A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization
Not on the map. Why?
Abstract (arXiv)
In this paper, we consider an unconstrained stochastic optimization problem where the objective function exhibits high-order smoothness. Specifically, we propose a new stochastic first-order method (SFOM) with multi-extrapolated momentum, in which multiple extrapolations are performed in each iteration, followed by a momentum update based on these extrapolations. We demonstrate that the proposed SFOM can accelerate optimization by exploiting the high-order smoothness of the objective function f. Assuming that the pth-order derivative of f is Lipschitz continuous for some p≥2, and under additional mild assumptions, we establish that our method achieves a sample complexity of widetildeO(ε-(3p+1)/p) for finding a point x such that mathbbE[|nabla f(x)|]≤ε. To the best of our knowledge, this is the first SFOM to leverage arbitrary-order smoothness of the objective function for acceleration, resulting in a sample complexity that improves upon the best-known results without assuming the mean-squared smoothness condition. Preliminary numerical experiments validate the practical performance of our method and support our theoretical findings.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 34 references that are in the map. First posted on arXiv 19 Dec 2024.
Builds on
28 of 34 references.
References · 28
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 303
- 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 302
- 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 283
- 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 218
- 2020Momentum Improves Normalized SGDcited by 136
- 2020PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimizationcited by 116
- 2013Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programmingcited by 74
- 2017Non-convex Finite-Sum Optimization Via SCSG Methodscited by 61
- 2017"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functionscited by 46
16 more
- 2019Sharp Analysis for Nonconvex SGD Escaping from Saddle Pointscited by 40
- 2022Towards understanding how momentum improves generalization in deep learningcited by 40
- 2020Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitationscited by 39
- 2019ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimizationcited by 37
- 2019A Hybrid Stochastic Optimization Framework for Stochastic Composite Nonconvex Optimizationcited by 27
- 2022Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimizationcited by 19
- 2023Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraintscited by 16
- 2020Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimizationcited by 14
- 2024Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guaranteescited by 11
- 2020Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimizationcited by 10
- 2021On the Last Iterate Convergence of Momentum Methodscited by 9
- 2024Non-convex Stochastic Composite Optimization with Polyak Momentumcited by 9
- 2017Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learningcited by 7
- 2023A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guaranteescited by 6
- 2020Quickly Finding a Benign Region via Heavy Ball Momentum in Non-Convex Optimizationcited by 5
- 2024Stochastic interior-point methods for smooth conic optimization with applicationscited by 1
Built on by
Not cited yet.