{"total":21,"rows":[{"id":"2302.01186","title":"The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing","created":"2023-02-02","cited_by_count":33,"area":null},{"id":"2206.03345","title":"Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification","created":"2022-06-07","cited_by_count":21,"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":"2206.08756","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","created":"2022-06-17","cited_by_count":15,"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":"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.11940","title":"Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent","created":"2024-01-22","cited_by_count":7,"area":null},{"id":"2402.06756","title":"Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion","created":"2024-02-09","cited_by_count":6,"area":null},{"id":"2209.13394","title":"Magnitude and Angle Dynamics in Training Single ReLU Neurons","created":"2022-09-27","cited_by_count":5,"area":null},{"id":"2210.00346","title":"Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition","created":"2022-10-01","cited_by_count":4,"area":null},{"id":"2305.06199","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","created":"2023-05-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":"2207.07612","title":"Blessing of Nonconvexity in Deep Linear Models: Depth Flattens the Optimization Landscape Around the True Solution","created":"2022-07-15","cited_by_count":3,"area":null},{"id":"2602.05887","title":"Escaping Local Minima Provably in Non-convex Matrix Sensing: A Deterministic Framework via Simulated Lifting","created":"2026-02-05","cited_by_count":3,"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":"2410.15224","title":"Robust Low-rank Tensor Train Recovery","created":"2024-10-19","cited_by_count":2,"area":null},{"id":"2310.15549","title":"Algorithmic Regularization in Tensor Optimization: Towards a Lifted Approach in Matrix Sensing","created":"2023-10-24","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":"2410.05025","title":"$\\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2504.09648","title":"RANSAC Revisited: An Improved Algorithm for Robust Subspace Recovery under Adversarial and Noisy Corruptions","created":"2025-04-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}],"next_cursor":null}