{"total":81,"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":"2203.01238","title":"On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features","created":"2022-03-02","cited_by_count":97,"area":null},{"id":"2106.15013","title":"Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction","created":"2021-06-28","cited_by_count":78,"area":null},{"id":"2210.02192","title":"Are All Losses Created Equal: A Neural Collapse Perspective","created":"2022-10-04","cited_by_count":78,"area":null},{"id":"2304.00488","title":"Saddle-to-Saddle Dynamics in Diagonal Linear Networks","created":"2023-04-02","cited_by_count":57,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"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":"2209.03525","title":"Implicit Full Waveform Inversion with Deep Neural Representation","created":"2022-09-08","cited_by_count":26,"area":null},{"id":"2406.04112","title":"Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation","created":"2024-06-06","cited_by_count":26,"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":"2202.08788","title":"Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization","created":"2022-02-17","cited_by_count":21,"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":"2306.01154","title":"The Law of Parsimony in Gradient Descent for Learning Deep Linear Networks","created":"2023-06-01","cited_by_count":20,"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":"2110.04814","title":"Finding Second-Order Stationary Points in Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-10-10","cited_by_count":12,"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":"2108.11832","title":"Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization","created":"2021-08-26","cited_by_count":11,"area":null},{"id":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"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":"2102.02969","title":"Sign-RIP: A Robust Restricted Isometry Property for Low-rank Matrix Recovery","created":"2021-02-05","cited_by_count":10,"area":null},{"id":"2306.17378","title":"Global Optimality in Bivariate Gradient-based DAG Learning","created":"2023-06-30","cited_by_count":10,"area":null},{"id":"2106.11950","title":"Fundamental limits for rank-one matrix estimation with groupwise heteroskedasticity","created":"2021-06-22","cited_by_count":8,"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":"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":"2106.09815","title":"Escaping strict saddle points of the Moreau envelope in nonsmooth optimization","created":"2021-06-17","cited_by_count":7,"area":null},{"id":"2104.08928","title":"Group-Sparse Matrix Factorization for Transfer Learning of Word Embeddings","created":"2021-04-18","cited_by_count":6,"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":"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":"2206.05317","title":"Intrinsic dimensionality and generalization properties of the $\\mathcal{R}$-norm inductive bias","created":"2022-06-10","cited_by_count":5,"area":null},{"id":"2208.02083","title":"Gradient descent provably escapes saddle points in the training of shallow ReLU networks","created":"2022-08-03","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":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"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":"2212.09396","title":"Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization","created":"2022-12-19","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":"2102.00937","title":"Riemannian Perspective on Matrix Factorization","created":"2021-02-01","cited_by_count":3,"area":null},{"id":"2103.09424","title":"Escaping Saddle Points in Distributed Newton's Method with Communication Efficiency and Byzantine Resilience","created":"2021-03-17","cited_by_count":3,"area":null},{"id":"2201.01387","title":"Joint Learning-Based Stabilization of Multiple Unknown Linear Systems","created":"2022-01-01","cited_by_count":3,"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":"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.18858","title":"Bilinear Sequence Regression: A Model for Learning from Long Sequences of High-dimensional Tokens","created":"2024-10-24","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":"2205.13827","title":"Error Bound of Empirical $\\ell_2$ Risk Minimization for Noisy Standard and Generalized Phase Retrieval Problems","created":"2022-05-27","cited_by_count":2,"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":"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.12292","title":"Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion","created":"2023-05-20","cited_by_count":2,"area":null},{"id":"2309.01796","title":"Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations","created":"2023-09-04","cited_by_count":2,"area":null},{"id":"2403.10547","title":"Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing","created":"2024-03-12","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":"2509.21675","title":"Scalable Second-order Riemannian Optimization for $K$-means Clustering","created":"2025-09-25","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":"2105.10090","title":"Escaping Saddle Points with Compressed SGD","created":"2021-05-21","cited_by_count":1,"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":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","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":"2311.15221","title":"The Local Landscape of Phase Retrieval Under Limited Samples","created":"2023-11-26","cited_by_count":1,"area":null},{"id":"2401.09274","title":"Avoiding strict saddle points of nonconvex regularized problems","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2402.17595","title":"Implicit Regularization via Spectral Neural Networks and Non-linear Matrix Sensing","created":"2024-02-27","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.06878","title":"Noise is All You Need: Private Second-Order Convergence of Noisy SGD","created":"2024-10-09","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":"2605.03724","title":"Rethinking the Rank Threshold for LoRA Fine-Tuning","created":"2026-05-05","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":"2406.04588","title":"Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model","created":"2024-06-07","cited_by_count":0,"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":"2502.16391","title":"Subspace Recovery in Winsorized PCA: Insights into Accuracy and Robustness","created":"2025-02-23","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":"2509.00737","title":"Convergence Analysis of the ProbAbilistic Gradient Estimator Algorithm for Weakly Convex Finite-Sum Optimization","created":"2025-08-31","cited_by_count":0,"area":null},{"id":"2602.01339","title":"Finding Differentially Private Second Order Stationary Points in Stochastic Minimax Optimization","created":"2026-02-01","cited_by_count":0,"area":null},{"id":"2605.28613","title":"Stability of Low-Rank Implicit Regularization in Perturbed Deep Matrix Factorization","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2608.03001","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2609.30501","title":"To Solve Bilevel Optimization with Nonconvex Lower Levels, We Need Second-Order Stationarity","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2609.37865","title":"Strict-Saddle Landscapes and Multi-Rank Geometry in Low-Tubal-Rank Tensor Sensing","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.18318","title":"Over-parameterization Is Neither Robust nor Fragile in Matrix Sensing: A Geometric Theory of Solution Robustness","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}