{"total":123,"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.15651","title":"Learning Single-Index Models with Shallow Neural Networks","created":"2022-10-27","cited_by_count":92,"area":null},{"id":"2110.02796","title":"An Unconstrained Layer-Peeled Perspective on Neural Collapse","created":"2021-10-06","cited_by_count":87,"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":"2305.10633","title":"Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models","created":"2023-05-18","cited_by_count":61,"area":null},{"id":"2402.11867","title":"LoRA Training in the NTK Regime has No Spurious Local Minima","created":"2024-02-19","cited_by_count":48,"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":"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":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","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":"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":"2201.00703","title":"Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function","created":"2022-01-03","cited_by_count":21,"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":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"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":"2110.01602","title":"Clustering a Mixture of Gaussians with Unknown Covariance","created":"2021-10-04","cited_by_count":14,"area":null},{"id":"2206.03688","title":"Identifying good directions to escape the NTK regime and efficiently learn low-degree plus sparse polynomials","created":"2022-06-08","cited_by_count":13,"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":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","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":"2107.09802","title":"Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates","created":"2021-07-20","cited_by_count":10,"area":null},{"id":"2109.09859","title":"Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspective","created":"2021-09-20","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":"2402.11173","title":"How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2209.14501","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","created":"2022-09-29","cited_by_count":9,"area":null},{"id":"2404.06391","title":"Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity","created":"2024-04-09","cited_by_count":9,"area":null},{"id":"2103.13462","title":"Why Do Local Methods Solve Nonconvex Problems?","created":"2021-03-24","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":"2102.13233","title":"Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations","created":"2021-02-25","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":"2306.14522","title":"Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning","created":"2023-06-26","cited_by_count":7,"area":null},{"id":"2103.06875","title":"For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functions","created":"2021-03-11","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":"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.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","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":"2401.08330","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","created":"2024-01-16","cited_by_count":6,"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":"2106.06153","title":"Towards Understanding Generalization via Decomposing Excess Risk Dynamics","created":"2021-06-11","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":"2110.13969","title":"Nonparametric Matrix Estimation with One-Sided Covariates","created":"2021-10-26","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.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":"2103.15010","title":"On the Stability of Nonlinear Receding Horizon Control: A Geometric Perspective","created":"2021-03-27","cited_by_count":4,"area":null},{"id":"2111.01040","title":"STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization","created":"2021-11-01","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":"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":"2308.03661","title":"Matrix Completion in Almost-Verification Time","created":"2023-08-07","cited_by_count":4,"area":null},{"id":"2406.05822","title":"Symmetric Matrix Completion with ReLU Sampling","created":"2024-06-09","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":"2102.02396","title":"Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent","created":"2021-02-04","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.16982","title":"Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization","created":"2024-10-22","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":"2504.08178","title":"A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression","created":"2025-04-11","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":"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":"2104.10314","title":"Efficient Sparse Coding using Hierarchical Riemannian Pursuit","created":"2021-04-21","cited_by_count":2,"area":null},{"id":"2201.04822","title":"A Geometric Approach to $k$-means","created":"2022-01-13","cited_by_count":2,"area":null},{"id":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","cited_by_count":2,"area":null},{"id":"2210.05987","title":"A Momentum Accelerated Adaptive Cubic Regularization Method for Nonconvex Optimization","created":"2022-10-12","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":"2306.04049","title":"One-sided Matrix Completion from Two Observations Per Row","created":"2023-06-06","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":"2503.06001","title":"Analyzing the Role of Permutation Invariance in Linear Mode Connectivity","created":"2025-03-08","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":"2101.02397","title":"A Comprehensive Study on Optimization Strategies for Gradient Descent In Deep Learning","created":"2021-01-07","cited_by_count":1,"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":"2105.10090","title":"Escaping Saddle Points with Compressed SGD","created":"2021-05-21","cited_by_count":1,"area":null},{"id":"2106.15493","title":"Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries","created":"2021-06-29","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.12046","title":"Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise","created":"2021-10-22","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":"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":"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":"2405.11397","title":"Preparing for Black Swans: The Antifragility Imperative for Machine Learning","created":"2024-05-18","cited_by_count":1,"area":null},{"id":"2408.13767","title":"Lecture Notes on Linear Neural Networks: A Tale of Optimization and Generalization in Deep Learning","created":"2024-08-25","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":"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"}