{"total":40,"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":"2101.12699","title":"Exploring Deep Neural Networks via Layer-Peeled Model: Minority Collapse in Imbalanced Training","created":"2021-01-29","cited_by_count":166,"area":null},{"id":"2106.14343","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","created":"2021-06-28","cited_by_count":80,"area":null},{"id":"2102.12470","title":"On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)","created":"2021-02-24","cited_by_count":73,"area":null},{"id":"2210.01513","title":"The Dynamics of Sharpness-Aware Minimization: Bouncing Across Ravines and Drifting Towards Wide Minima","created":"2022-10-04","cited_by_count":51,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"id":"2106.13792","title":"Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descent","created":"2021-06-25","cited_by_count":21,"area":null},{"id":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2410.16561","title":"Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration","created":"2024-10-21","cited_by_count":18,"area":null},{"id":"2110.01663","title":"Global Convergence and Stability of Stochastic Gradient Descent","created":"2021-10-04","cited_by_count":17,"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":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"area":null},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","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":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"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":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","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":"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":"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":"2106.03763","title":"Vanishing Curvature and the Power of Adaptive Methods in Randomly Initialized Deep Networks","created":"2021-06-07","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":"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":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","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":"2105.10090","title":"Escaping Saddle Points with Compressed SGD","created":"2021-05-21","cited_by_count":1,"area":null},{"id":"2302.07862","title":"Almost Sure Saddle Avoidance of Stochastic Gradient Methods without the Bounded Gradient Assumption","created":"2023-02-15","cited_by_count":1,"area":null},{"id":"2311.13169","title":"SiGeo: Sub-One-Shot NAS via Information Theory and Geometry of Loss Landscape","created":"2023-11-22","cited_by_count":1,"area":null},{"id":"2509.02937","title":"Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization","created":"2025-09-03","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":"2409.06542","title":"Dynamic Decoupling of Placid Terminal Attractor-based Gradient Descent Algorithm","created":"2024-09-10","cited_by_count":0,"area":null},{"id":"2412.14488","title":"A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization","created":"2024-12-19","cited_by_count":0,"area":null},{"id":"2503.02129","title":"Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon","created":"2025-03-03","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.00473","title":"Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2605.28513","title":"Learning Theory of the SVRG: Generalization and Convergence Analysis","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}