{"total":127,"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":"2210.02192","title":"Are All Losses Created Equal: A Neural Collapse Perspective","created":"2022-10-04","cited_by_count":78,"area":null},{"id":"2110.03677","title":"Large Learning Rate Tames Homogeneity: Convergence and Balancing Effect","created":"2021-10-07","cited_by_count":50,"area":null},{"id":"2402.01258","title":"Transformers Learn Nonlinear Features In Context: Nonconvex Mean-field Dynamics on the Attention Landscape","created":"2024-02-02","cited_by_count":46,"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":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"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":"2201.08025","title":"Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscape","created":"2022-01-20","cited_by_count":39,"area":null},{"id":"2102.04168","title":"Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature","created":"2021-02-08","cited_by_count":32,"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":"2203.03756","title":"Flat minima generalize for low-rank matrix recovery","created":"2022-03-07","cited_by_count":28,"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":"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":"2112.10955","title":"Joint Learning of Linear Time-Invariant Dynamical Systems","created":"2021-12-21","cited_by_count":16,"area":null},{"id":"2102.12430","title":"Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorization","created":"2021-02-24","cited_by_count":15,"area":null},{"id":"2410.18965","title":"On the Crucial Role of Initialization for Matrix Factorization","created":"2024-10-24","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":"2406.01909","title":"A Global Geometric Analysis of Maximal Coding Rate Reduction","created":"2024-06-04","cited_by_count":13,"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":"2203.14383","title":"Continual learning: a feature extraction formalization, an efficient algorithm, and fundamental obstructions","created":"2022-03-27","cited_by_count":11,"area":null},{"id":"2306.10171","title":"Bootstrapped Representations in Reinforcement Learning","created":"2023-06-16","cited_by_count":11,"area":null},{"id":"2105.10360","title":"Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices","created":"2021-05-21","cited_by_count":10,"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":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2212.07534","title":"Decentralized Nonconvex Optimization with Guaranteed Privacy and Accuracy","created":"2022-12-14","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":"2410.14802","title":"Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems","created":"2024-10-18","cited_by_count":10,"area":null},{"id":"2302.03682","title":"Approximate message passing from random initialization with applications to $\\mathbb{Z}_{2}$ synchronization","created":"2023-02-07","cited_by_count":9,"area":null},{"id":"2305.08687","title":"Accelerated Algorithms for Nonlinear Matrix Decomposition with the ReLU function","created":"2023-05-15","cited_by_count":9,"area":null},{"id":"2305.18436","title":"Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming","created":"2023-05-29","cited_by_count":9,"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":"2312.15081","title":"Learning Rich Rankings","created":"2023-12-22","cited_by_count":8,"area":null},{"id":"2509.09088","title":"An entropy formula for the Deep Linear Network","created":"2025-09-11","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":"2406.04596","title":"Federated Representation Learning in the Under-Parameterized Regime","created":"2024-06-07","cited_by_count":7,"area":null},{"id":"2509.25351","title":"Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Region","created":"2025-09-29","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":"2110.10279","title":"Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods","created":"2021-10-19","cited_by_count":6,"area":null},{"id":"2206.02040","title":"MetaNOR: A Meta-Learnt Nonlocal Operator Regression Approach for Metamaterial Modeling","created":"2022-06-04","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":"2210.12816","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","created":"2022-10-23","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":"2410.13981","title":"On the Learn-to-Optimize Capabilities of Transformers in In-Context Sparse Recovery","created":"2024-10-17","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":"2106.06153","title":"Towards Understanding Generalization via Decomposing Excess Risk Dynamics","created":"2021-06-11","cited_by_count":5,"area":null},{"id":"2109.10935","title":"Robust Generalization of Quadratic Neural Networks via Function Identification","created":"2021-09-22","cited_by_count":5,"area":null},{"id":"2110.13265","title":"On the Second-order Convergence Properties of Random Search Methods","created":"2021-10-25","cited_by_count":5,"area":null},{"id":"2204.14067","title":"Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition","created":"2022-04-29","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":"2302.04753","title":"Efficient displacement convex optimization with particle gradient descent","created":"2023-02-09","cited_by_count":5,"area":null},{"id":"2305.15311","title":"Personalized Dictionary Learning for Heterogeneous Datasets","created":"2023-05-24","cited_by_count":5,"area":null},{"id":"2311.11841","title":"High Probability Guarantees for Random Reshuffling","created":"2023-11-20","cited_by_count":5,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","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":"2107.00371","title":"Sparse GCA and Thresholded Gradient Descent","created":"2021-07-01","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":"2201.11945","title":"Learning Proximal Operators to Discover Multiple Optima","created":"2022-01-28","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":"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":"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":"2402.04751","title":"Asymptotic Dynamics of Alternating Minimization for Bilinear Regression","created":"2024-02-07","cited_by_count":3,"area":null},{"id":"2412.20605","title":"LEARNER: A Transfer Learning Method for Low-Rank Matrix Estimation","created":"2024-12-29","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":"2604.21905","title":"Low-Rank Adaptation Redux for Large Models","created":"2026-04-23","cited_by_count":3,"area":null},{"id":"2606.29604","title":"Mechanistically Eliciting Latent Behaviors in Language Models","created":"2026-06-28","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":"2310.11866","title":"Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function","created":"2023-10-18","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.16974","title":"Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points","created":"2025-09-21","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":"2102.07541","title":"WGAN with an Infinitely Wide Generator Has No Spurious Stationary Points","created":"2021-02-15","cited_by_count":1,"area":null},{"id":"2106.09211","title":"Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery","created":"2021-06-17","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":"2204.13599","title":"Signal Recovery with Non-Expansive Generative Network Priors","created":"2022-04-24","cited_by_count":1,"area":null},{"id":"2212.00852","title":"Symphony in the Latent Space: Provably Integrating High-dimensional Techniques with Non-linear Machine Learning Models","created":"2022-12-01","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":"2310.18841","title":"A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees","created":"2023-10-28","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":"2410.23595","title":"Disentangling Interpretable Factors with Supervised Independent Subspace Principal Component Analysis","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2502.20033","title":"Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization","created":"2025-02-27","cited_by_count":1,"area":null}],"next_cursor":"100"}