{"total":32,"rows":[{"id":"2110.03677","title":"Large Learning Rate Tames Homogeneity: Convergence and Balancing Effect","created":"2021-10-07","cited_by_count":50,"area":null},{"id":"2102.02756","title":"On the computational and statistical complexity of over-parameterized matrix sensing","created":"2021-01-27","cited_by_count":31,"area":null},{"id":"2302.11068","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","created":"2023-02-21","cited_by_count":31,"area":null},{"id":"2205.13891","title":"Transformers from an Optimization Perspective","created":"2022-05-27","cited_by_count":27,"area":null},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17,"area":null},{"id":"2102.12430","title":"Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization","created":"2021-02-24","cited_by_count":15,"area":null},{"id":"2204.11516","title":"Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing","created":"2022-04-25","cited_by_count":11,"area":null},{"id":"2106.12933","title":"GNMR: A provable one-line algorithm for low rank matrix recovery","created":"2021-06-24","cited_by_count":10,"area":null},{"id":"2206.05553","title":"Convergence and Recovery Guarantees of the K-Subspaces Method for Subspace Clustering","created":"2022-06-11","cited_by_count":9,"area":null},{"id":"2212.04025","title":"A Novel Stochastic Gradient Descent Algorithm for Learning Principal Subspaces","created":"2022-12-08","cited_by_count":7,"area":null},{"id":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"area":null},{"id":"2108.01772","title":"Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization","created":"2021-08-03","cited_by_count":4,"area":null},{"id":"2204.01815","title":"Tensor Completion with Provable Consistency and Fairness Guarantees for Recommender Systems","created":"2022-04-04","cited_by_count":4,"area":null},{"id":"2206.04276","title":"Robust Matrix Completion with Heavy-tailed Noise","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2308.03661","title":"Matrix Completion in Almost-Verification Time","created":"2023-08-07","cited_by_count":4,"area":null},{"id":"2410.06376","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","created":"2024-10-08","cited_by_count":4,"area":null},{"id":"2102.00937","title":"Riemannian Perspective on Matrix Factorization","created":"2021-02-01","cited_by_count":3,"area":null},{"id":"2102.02396","title":"Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent","created":"2021-02-04","cited_by_count":3,"area":null},{"id":"2412.20605","title":"LEARNER: A Transfer Learning Method for Low-Rank Matrix Estimation","created":"2024-12-29","cited_by_count":3,"area":null},{"id":"2305.12292","title":"Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion","created":"2023-05-20","cited_by_count":2,"area":null},{"id":"2306.04049","title":"One-sided Matrix Completion from Two Observations Per Row","created":"2023-06-06","cited_by_count":2,"area":null},{"id":"2411.06697","title":"Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2106.13681","title":"Robust Matrix Factorization with Grouping Effect","created":"2021-06-25","cited_by_count":0,"area":null},{"id":"2307.08857","title":"An Admissible Shift-Consistent Method for Recommender Systems","created":"2023-07-17","cited_by_count":0,"area":null},{"id":"2403.01919","title":"Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpainting","created":"2024-03-04","cited_by_count":0,"area":null},{"id":"2405.06569","title":"Efficient Federated Low Rank Matrix Completion","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2409.19550","title":"Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion","created":"2024-09-29","cited_by_count":0,"area":null},{"id":"2411.06333","title":"A Learned Proximal Alternating Minimization Algorithm and Its Induced Network for a Class of Two-block Nonconvex and Nonsmooth Optimization","created":"2024-11-10","cited_by_count":0,"area":null},{"id":"2412.10005","title":"Matrix Completion via Residual Spectral Matching","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2501.19224","title":"Fast exact recovery of noisy matrix from few entries: the infinity norm approach","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2508.00091","title":"Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness","created":"2025-07-31","cited_by_count":0,"area":null},{"id":"2511.01196","title":"An Interdisciplinary and Cross-Task Review on Missing Data Imputation","created":"2025-11-03","cited_by_count":0,"area":null}],"next_cursor":null}