{"total":38,"rows":[{"id":"2304.00488","title":"Saddle-to-Saddle Dynamics in Diagonal Linear Networks","created":"2023-04-02","cited_by_count":57,"area":null},{"id":"2106.14289","title":"Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization","created":"2021-06-27","cited_by_count":45,"area":null},{"id":"2104.14526","title":"Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements","created":"2021-04-29","cited_by_count":28,"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":"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":"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":"2401.02592","title":"Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery","created":"2024-01-05","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.07006","title":"Fast quantum state reconstruction via accelerated non-convex programming","created":"2021-04-14","cited_by_count":5,"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":"2105.12257","title":"Rank-one matrix estimation: analytic time evolution of gradient descent dynamics","created":"2021-05-25","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":"2305.17224","title":"Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent","created":"2023-05-26","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":"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":"2410.16826","title":"Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery","created":"2024-10-22","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":"2402.04751","title":"Asymptotic Dynamics of Alternating Minimization for Bilinear Regression","created":"2024-02-07","cited_by_count":3,"area":null},{"id":"2408.13276","title":"Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity","created":"2024-08-20","cited_by_count":3,"area":null},{"id":"2410.09640","title":"Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks","created":"2024-10-12","cited_by_count":3,"area":null},{"id":"2505.22602","title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","created":"2025-05-28","cited_by_count":3,"area":null},{"id":"2301.04204","title":"A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization","created":"2023-01-10","cited_by_count":2,"area":null},{"id":"2311.11182","title":"Exponentially Convergent Algorithms for Supervised Matrix Factorization","created":"2023-11-18","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2107.09144","title":"Wave-Informed Matrix Factorization with Global Optimality Guarantees","created":"2021-07-19","cited_by_count":1,"area":null},{"id":"2206.06774","title":"Supervised Dictionary Learning with Auxiliary Covariates","created":"2022-06-14","cited_by_count":1,"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":"2501.16322","title":"Implicit Bias in Matrix Factorization and its Explicit Realization in a New Architecture","created":"2025-01-27","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":"2312.13584","title":"Wave Physics-informed Matrix Factorizations","created":"2023-12-21","cited_by_count":0,"area":null},{"id":"2506.18282","title":"Phase retrieval with rank $d$ measurements -- \\emph{descending} algorithms phase transitions","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2602.07479","title":"ODELoRA: Training Low-Rank Adaptation by Solving Ordinary Differential Equations","created":"2026-02-07","cited_by_count":0,"area":null},{"id":"2602.20376","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","created":"2026-02-23","cited_by_count":0,"area":null},{"id":"2604.00060","title":"Scaled Gradient Descent for Ill-Conditioned Low-Rank Matrix Recovery with Optimal Sampling Complexity","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2604.18820","title":"Sparse Network Inference under Imperfect Detection and its Application to Ecological Networks","created":"2026-04-20","cited_by_count":0,"area":null},{"id":"2605.10741","title":"AdaPaD: Adaptive Parallel Deflation for PEFT with Self-Correcting Rank Discovery","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2608.10045","title":"Finding the Signal in the Spam: Jointly Learning Rewards and Worker Reliability from Pairwise Comparisons","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}