{"total":17,"rows":[{"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":"2504.09708","title":"Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization","created":"2025-04-13","cited_by_count":12,"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":"2107.09802","title":"Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates","created":"2021-07-20","cited_by_count":10,"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":"2310.06159","title":"Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization","created":"2023-10-09","cited_by_count":6,"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":"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":"2406.02157","title":"Online Learning and Information Exponents: On The Importance of Batch size, and Time/Complexity Tradeoffs","created":"2024-06-04","cited_by_count":3,"area":null},{"id":"2604.21905","title":"Low-Rank Adaptation Redux for Large Models","created":"2026-04-23","cited_by_count":3,"area":null},{"id":"2303.11453","title":"Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing","created":"2023-03-20","cited_by_count":1,"area":null},{"id":"2407.19446","title":"Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions","created":"2024-07-28","cited_by_count":1,"area":null},{"id":"2405.06569","title":"Efficient Federated Low Rank Matrix Completion","created":"2024-05-10","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}],"next_cursor":null}