{"total":35,"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":"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":"2302.01734","title":"Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies","created":"2023-02-03","cited_by_count":58,"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":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2405.18199","title":"Adam with model exponential moving average is effective for nonconvex optimization","created":"2024-05-28","cited_by_count":23,"area":null},{"id":"2205.12856","title":"Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function","created":"2022-05-25","cited_by_count":20,"area":null},{"id":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","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":"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":"2103.03265","title":"Better SGD using Second-order Momentum","created":"2021-03-04","cited_by_count":15,"area":null},{"id":"2411.07061","title":"General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization","created":"2024-11-11","cited_by_count":15,"area":null},{"id":"2205.08253","title":"Momentum-Based Policy Gradient with Second-Order Information","created":"2022-05-17","cited_by_count":13,"area":null},{"id":"2210.06328","title":"Momentum Aggregation for Private Non-convex ERM","created":"2022-10-12","cited_by_count":10,"area":null},{"id":"2406.19579","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","created":"2024-06-27","cited_by_count":8,"area":null},{"id":"2110.02954","title":"A Stochastic Newton Algorithm for Distributed Convex Optimization","created":"2021-10-07","cited_by_count":6,"area":null},{"id":"2304.10613","title":"Debiasing Conditional Stochastic Optimization","created":"2023-04-20","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":"2407.01825","title":"Reevaluating Theoretical Analysis Methods for Optimization in Deep Learning","created":"2024-07-01","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":"2510.10690","title":"Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits","created":"2025-10-12","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":"2212.06283","title":"Variance-Reduced Conservative Policy Iteration","created":"2022-12-12","cited_by_count":2,"area":null},{"id":"2103.05138","title":"On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization","created":"2021-03-08","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":"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":"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":"2301.12174","title":"Stochastic Dimension-reduced Second-order Methods for Policy Optimization","created":"2023-01-28","cited_by_count":0,"area":null},{"id":"2308.10630","title":"A Homogenization Approach for Gradient-Dominated Stochastic Optimization","created":"2023-08-21","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.04204","title":"FUSE: First-Order and Second-Order Unified SynthEsis in Stochastic Optimization","created":"2025-03-06","cited_by_count":0,"area":null},{"id":"2506.23836","title":"Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction","created":"2025-06-30","cited_by_count":0,"area":null},{"id":"2602.03802","title":"Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods","created":"2026-02-03","cited_by_count":0,"area":null}],"next_cursor":null}