{"total":35,"rows":[{"id":"2105.02375","title":"A Geometric Analysis of Neural Collapse with Unconstrained Features","created":"2021-05-06","cited_by_count":227,"area":null},{"id":"2301.11500","title":"Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensing","created":"2023-01-27","cited_by_count":42,"area":null},{"id":"2109.11154","title":"Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery","created":"2021-09-23","cited_by_count":22,"area":null},{"id":"2502.09376","title":"LoRA Training Provably Converges to a Low-Rank Global Minimum or It Fails Loudly (But it Probably Won't Fail)","created":"2025-02-13","cited_by_count":20,"area":null},{"id":"2310.01769","title":"How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization","created":"2023-10-03","cited_by_count":18,"area":null},{"id":"2207.01789","title":"Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization","created":"2022-07-05","cited_by_count":13,"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":"2203.03899","title":"Noisy Low-rank Matrix Optimization: Geometry of Local Minima and Convergence Rate","created":"2022-03-08","cited_by_count":8,"area":null},{"id":"2209.10675","title":"A Validation Approach to Over-parameterized Matrix and Image Recovery","created":"2022-09-21","cited_by_count":8,"area":null},{"id":"2401.02592","title":"Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery","created":"2024-01-05","cited_by_count":8,"area":null},{"id":"2605.19407","title":"A Bitter Lesson for Data Filtering","created":"2026-05-19","cited_by_count":8,"area":null},{"id":"2105.08232","title":"Sharp Restricted Isometry Property Bounds for Low-rank Matrix Recovery Problems with Corrupted Measurements","created":"2021-05-18","cited_by_count":7,"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":"2104.10790","title":"Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime","created":"2021-04-21","cited_by_count":5,"area":null},{"id":"2208.07469","title":"Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing","created":"2022-08-15","cited_by_count":5,"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":"2201.13052","title":"Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2209.15130","title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","created":"2022-09-29","cited_by_count":4,"area":null},{"id":"2406.06002","title":"Computational and Statistical Guarantees for Tensor-on-Tensor Regression with Tensor Train Decomposition","created":"2024-06-10","cited_by_count":4,"area":null},{"id":"2502.00463","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","created":"2025-02-01","cited_by_count":4,"area":null},{"id":"2506.16032","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2410.16982","title":"Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization","created":"2024-10-22","cited_by_count":3,"area":null},{"id":"2101.05113","title":"Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing","created":"2021-01-13","cited_by_count":2,"area":null},{"id":"2302.10963","title":"Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?","created":"2023-02-21","cited_by_count":2,"area":null},{"id":"2305.19206","title":"Gradient descent in matrix factorization: Understanding large initialization","created":"2023-05-30","cited_by_count":2,"area":null},{"id":"2506.20344","title":"A Complete Loss Landscape Analysis of Regularized Deep Matrix Factorization","created":"2025-06-25","cited_by_count":2,"area":null},{"id":"2205.03059","title":"Low-rank Tensor Learning with Nonconvex Overlapped Nuclear Norm Regularization","created":"2022-05-06","cited_by_count":1,"area":null},{"id":"2403.06056","title":"Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses","created":"2024-03-10","cited_by_count":1,"area":null},{"id":"2505.03717","title":"Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima","created":"2025-05-06","cited_by_count":1,"area":null},{"id":"2310.04953","title":"Robust matrix completion via Novel M-estimator Functions","created":"2023-10-08","cited_by_count":0,"area":null},{"id":"2412.10182","title":"Multi-Head Encoding for Extreme Label Classification","created":"2024-12-13","cited_by_count":0,"area":null},{"id":"2505.12919","title":"RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2511.01234","title":"A Saddle Point Remedy: Power of Variable Elimination in Non-convex Optimization","created":"2025-11-03","cited_by_count":0,"area":null},{"id":"2604.13393","title":"A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2610.06542","title":"A Fine-Grained Analysis of the LoRA Fine-Tuning Landscape with Implications for Data Selection","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}