{"total":89,"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":"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":"2110.03677","title":"Large Learning Rate Tames Homogeneity: Convergence and Balancing Effect","created":"2021-10-07","cited_by_count":50,"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":"2106.12108","title":"Near-Optimal Linear Regression under Distribution Shift","created":"2021-06-23","cited_by_count":42,"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":"2406.04112","title":"Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation","created":"2024-06-06","cited_by_count":26,"area":null},{"id":"2107.13289","title":"The loss landscape of deep linear neural networks: a second-order analysis","created":"2021-07-28","cited_by_count":24,"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":"2106.11428","title":"Local convexity of the TAP free energy and AMP convergence for Z2-synchronization","created":"2021-06-21","cited_by_count":15,"area":null},{"id":"2305.18502","title":"Escaping mediocrity: how two-layer networks learn hard generalized linear models with SGD","created":"2023-05-29","cited_by_count":15,"area":null},{"id":"2106.15358","title":"Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors","created":"2021-06-29","cited_by_count":14,"area":null},{"id":"2202.08064","title":"Learning a Single Neuron for Non-monotonic Activation Functions","created":"2022-02-16","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":"2106.01660","title":"Bandit Phase Retrieval","created":"2021-06-03","cited_by_count":12,"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":"2110.15824","title":"Tractability from overparametrization: The example of the negative perceptron","created":"2021-10-28","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":"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":"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":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2301.07737","title":"Catapult Dynamics and Phase Transitions in Quadratic Nets","created":"2023-01-18","cited_by_count":8,"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":"2110.15148","title":"A first-order primal-dual method with adaptivity to local smoothness","created":"2021-10-28","cited_by_count":7,"area":null},{"id":"2210.05571","title":"Misspecified Phase Retrieval with Generative Priors","created":"2022-10-11","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":"2403.02418","title":"The Role of the Time-Dependent Hessian in High-Dimensional Optimization","created":"2024-03-04","cited_by_count":7,"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":"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":"2502.16849","title":"Provable Benefits of Unsupervised Pre-training and Transfer Learning via Single-Index Models","created":"2025-02-24","cited_by_count":6,"area":null},{"id":"2105.03678","title":"Nearly Minimax-Optimal Rates for Noisy Sparse Phase Retrieval via Early-Stopped Mirror Descent","created":"2021-05-08","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":"2306.02422","title":"A Generalized Alternating Method for Bilevel Learning under the Polyak-{\\L}ojasiewicz Condition","created":"2023-06-04","cited_by_count":5,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","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":"2411.05708","title":"Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models","created":"2024-11-08","cited_by_count":4,"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":"2110.12121","title":"On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization","created":"2021-10-23","cited_by_count":3,"area":null},{"id":"2204.10536","title":"Sharper Utility Bounds for Differentially Private Models","created":"2022-04-22","cited_by_count":3,"area":null},{"id":"2211.02163","title":"A Riemannian ADMM","created":"2022-11-03","cited_by_count":3,"area":null},{"id":"2405.10289","title":"On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning","created":"2024-05-16","cited_by_count":3,"area":null},{"id":"2405.10754","title":"Stable Phase Retrieval with Mirror Descent","created":"2024-05-17","cited_by_count":3,"area":null},{"id":"2504.09509","title":"Optimal sparse phase retrieval via a quasi-Bayesian approach","created":"2025-04-13","cited_by_count":3,"area":null},{"id":"2505.15647","title":"Second-Order Convergence in Private Stochastic Non-Convex Optimization","created":"2025-05-21","cited_by_count":3,"area":null},{"id":"2201.04822","title":"A Geometric Approach to $k$-means","created":"2022-01-13","cited_by_count":2,"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":"2210.05987","title":"A Momentum Accelerated Adaptive Cubic Regularization Method for Nonconvex Optimization","created":"2022-10-12","cited_by_count":2,"area":null},{"id":"2210.09248","title":"Provable Phase Retrieval with Mirror Descent","created":"2022-10-17","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.19206","title":"Gradient descent in matrix factorization: Understanding large initialization","created":"2023-05-30","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":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2510.18435","title":"Overparametrization bends the landscape: BBP transitions at initialization in simple Neural Networks","created":"2025-10-21","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":"2106.15493","title":"Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries","created":"2021-06-29","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":"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":"2311.12888","title":"Acceleration and Implicit Regularization in Gaussian Phase Retrieval","created":"2023-11-21","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":"2409.04733","title":"A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval","created":"2024-09-07","cited_by_count":1,"area":null},{"id":"2601.18245","title":"Tractable Gaussian Phase Retrieval with Heavy Tails and Adversarial Corruption with Near-Linear Sample Complexity","created":"2026-01-26","cited_by_count":1,"area":null},{"id":"2606.04476","title":"When Both Layers Learn: Training Dynamics of Representing Linear Models via ReLU Networks","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2111.05232","title":"Learning Rates for Nonconvex Pairwise Learning","created":"2021-11-09","cited_by_count":0,"area":null},{"id":"2207.08195","title":"SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization","created":"2022-07-17","cited_by_count":0,"area":null},{"id":"2304.11788","title":"Can Decentralized Stochastic Minimax Optimization Algorithms Converge Linearly for Finite-Sum Nonconvex-Nonconcave Problems?","created":"2023-04-24","cited_by_count":0,"area":null},{"id":"2409.01570","title":"Smoothed Robust Phase Retrieval","created":"2024-09-03","cited_by_count":0,"area":null},{"id":"2410.09990","title":"Global convergence of gradient descent for phase retrieval","created":"2024-10-13","cited_by_count":0,"area":null},{"id":"2501.02180","title":"Quaternionic Reweighted Amplitude Flow for Phase Retrieval in Image Reconstruction","created":"2025-01-04","cited_by_count":0,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2506.18275","title":"Phase transition of \\emph{descending} phase retrieval algorithms","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2506.18279","title":"Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view","created":"2025-06-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":"2511.06686","title":"Balancing Multi-modal Sensor Learning via Multi-objective Optimization","created":"2025-11-10","cited_by_count":0,"area":null},{"id":"2601.15915","title":"Progressive Power Homotopy for Non-convex Optimization","created":"2026-01-22","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}],"next_cursor":null}