{"total":66,"rows":[{"id":"2208.06677","title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","created":"2022-08-13","cited_by_count":174,"area":null},{"id":"2506.15054","title":"Muon Optimizes Under Spectral Norm Constraints","created":"2025-06-18","cited_by_count":86,"area":null},{"id":"2105.10446","title":"ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reduction","created":"2021-05-21","cited_by_count":84,"area":null},{"id":"2411.16085","title":"Cautious Optimizers: Improving Training with One Line of Code","created":"2024-11-25","cited_by_count":47,"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":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19,"area":null},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17,"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":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"area":null},{"id":"2206.07553","title":"On the fast convergence of minibatch heavy ball momentum","created":"2022-06-15","cited_by_count":13,"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":"2403.05293","title":"Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networks","created":"2024-03-08","cited_by_count":9,"area":null},{"id":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","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":"2201.10447","title":"Differentially Private Temporal Difference Learning with Stochastic Nonconvex-Strongly-Concave Optimization","created":"2022-01-25","cited_by_count":7,"area":null},{"id":"2412.02175","title":"Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods","created":"2024-12-03","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":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","cited_by_count":6,"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":"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":"2310.11897","title":"Accelerated Policy Gradient: On the Convergence Rates of the Nesterov Momentum for Reinforcement Learning","created":"2023-10-18","cited_by_count":4,"area":null},{"id":"2310.14616","title":"Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz","created":"2023-10-23","cited_by_count":4,"area":null},{"id":"2412.17107","title":"Grams: Gradient Descent with Adaptive Momentum Scaling","created":"2024-12-22","cited_by_count":4,"area":null},{"id":"2109.15030","title":"On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport","created":"2021-09-29","cited_by_count":3,"area":null},{"id":"2203.12191","title":"An Adaptive Gradient Method with Energy and Momentum","created":"2022-03-23","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2511.22331","title":"On the Condition Number Dependency in Bilevel Optimization","created":"2025-11-27","cited_by_count":3,"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":"2207.05697","title":"A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees","created":"2022-07-12","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":"2401.09665","title":"Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks","created":"2024-01-18","cited_by_count":2,"area":null},{"id":"2412.18790","title":"Torque-Aware Momentum","created":"2024-12-25","cited_by_count":2,"area":null},{"id":"2510.17503","title":"Stochastic Difference-of-Convex Optimization with Momentum","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2606.20299","title":"Statistical Properties of Training & Generalization","created":"2026-06-18","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":"2103.00075","title":"Noisy Truncated SGD: Optimization and Generalization","created":"2021-02-26","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":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2304.08389","title":"Beyond first-order methods for non-convex non-concave min-max optimization","created":"2023-04-17","cited_by_count":1,"area":null},{"id":"2309.13307","title":"CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity","created":"2023-09-23","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":"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":"2606.05438","title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2101.02625","title":"Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm","created":"2021-01-07","cited_by_count":0,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2106.08775","title":"Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs","created":"2021-06-16","cited_by_count":0,"area":null},{"id":"2203.11829","title":"Provable Constrained Stochastic Convex Optimization with XOR-Projected Gradient Descent","created":"2022-03-22","cited_by_count":0,"area":null},{"id":"2204.11407","title":"Accelerated Multiplicative Weights Update Avoids Saddle Points almost always","created":"2022-04-25","cited_by_count":0,"area":null},{"id":"2205.13753","title":"HOUDINI: Escaping from Moderately Constrained Saddles","created":"2022-05-27","cited_by_count":0,"area":null},{"id":"2208.02208","title":"SGEM: stochastic gradient with energy and momentum","created":"2022-08-03","cited_by_count":0,"area":null},{"id":"2304.10499","title":"Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property","created":"2023-04-20","cited_by_count":0,"area":null},{"id":"2307.03590","title":"Accelerated Optimization Landscape of Linear-Quadratic Regulator","created":"2023-07-07","cited_by_count":0,"area":null},{"id":"2309.04877","title":"A Gentle Introduction to Gradient-Based Optimization and Variational Inequalities for Machine Learning","created":"2023-09-09","cited_by_count":0,"area":null},{"id":"2311.13094","title":"Newton-CG methods for nonconvex unconstrained optimization with H\\\"older continuous Hessian","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2403.09646","title":"On Unsupervised Image-to-image translation and GAN stability","created":"2023-10-18","cited_by_count":0,"area":null},{"id":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"area":null},{"id":"2411.04946","title":"SPGD: Steepest Perturbed Gradient Descent Optimization","created":"2024-11-07","cited_by_count":0,"area":null},{"id":"2411.16200","title":"Neural Network-based High-index Saddle Dynamics Method for Searching Saddle Points and Solution Landscape","created":"2024-11-25","cited_by_count":0,"area":null},{"id":"2502.19210","title":"Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2510.09034","title":"Convergence of optimizers implies eigenvalues filtering at equilibrium","created":"2025-10-10","cited_by_count":0,"area":null},{"id":"2511.17399","title":"Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes","created":"2025-11-21","cited_by_count":0,"area":null},{"id":"2603.01951","title":"Accelerating Single-Pass SGD for Generalized Linear Prediction","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2605.02127","title":"A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\\tilde{\\mkern1mu O}(\\epsilon^{-5/3})$ Global Rate","created":"2026-05-04","cited_by_count":0,"area":null},{"id":"2605.18609","title":"Perfect Parallelization in Mini-Batch SGD with Classical Momentum Acceleration","created":"2026-05-18","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}