Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-Lojasiewicz Functions when the Non-Convexity is Averaged-Out
Jun-Kun Wang, Chi-Heng Lin, Andre Wibisono, Bin Hu
Abstract
Heavy Ball (HB) nowadays is one of the most popular momentum methods in non-convex optimization. It has been widely observed that incorporating the Heavy Ball dynamic in gradient-based methods accelerates the training process of modern machine learning models. However, the progress on establishing its theoretical foundation of acceleration is apparently far behind its empirical success. Existing provable acceleration results are of the quadratic or close-to-quadratic functions, as the current techniques of showing HB's acceleration are limited to the case when the Hessian is fixed. In this work, we develop some new techniques that help show acceleration beyond quadratics, which is achieved by analyzing how the change of the Hessian at two consecutive time points affects the convergence speed. Based on our technical results, a class of Polyak-ojasiewicz (PL) optimization problems for which provable acceleration can be achieved via HB is identified. Moreover, our analysis demonstrates a benefit of adaptively setting the momentum parameter. (Update: 08/29/2023) Erratum is added in Appendix J. This is an updated version that fixes an issue in the previous version. An additional condition needs to be satisfied for the acceleration result of HB beyond quadratics in this work, which naturally holds when the dimension is one or, more broadly, when the Hessian is diagonal. We elaborate on the issue in Appendix J.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- Towards Understanding GD with Hard and Conjugate Pseudo-labels for Test-Time AdaptationJun-Kun Wang, Andre WibisonoICLR 2023 · 2 citations
- Enhancing Optimizer Stability: Momentum Adaptation of The NGN Step-sizeRustem Islamov, Niccolò Ajroldi, Antonio Orvieto, Aurélien LucchiNeurIPS 2025 · 1 citation
- Continuized Acceleration for Quasar Convex Functions in Non-Convex OptimizationJun-Kun Wang, Andre WibisonoICLR 2023 · 1 citation
- Accelerating Hamiltonian Monte Carlo via Chebyshev Integration TimeJun-Kun Wang, Andre WibisonoICLR 2023
- Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical PerformanceDimitris Oikonomou, Nicolas LoizouICLR 2025
Builds on8
- An Improved Analysis of Stochastic Gradient Descent with MomentumYanli Liu, Yuan Gao, Wotao YinNeurIPS 2020 · 328 citations
- High-probability Bounds for Non-Convex Stochastic Optimization with Heavy TailsAshok Cutkosky, Harsh MehtaNeurIPS 2021 · 119 citations
- The Implicit Bias of Depth: How Incremental Learning Drives GeneralizationDaniel Gissin, Shai Shalev-Shwartz, Amit DanielyICLR 2020 · 90 citations
- Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentJason M. Altschuler, Sinho Chewi, Patrik Gerber, Austin J. StrommeNeurIPS 2021 · 60 citations
- Non-asymptotic convergence bounds for Wasserstein approximation using point cloudsQuentin Mérigot, Filippo Santambrogio, Clément SarrazinNeurIPS 2021 · 40 citations
Related papers
- The Role of Momentum Parameters in the Optimal Convergence of Adaptive Polyak's Heavy-ball MethodsWei Tao, Sheng Long, Gaowei Wu, Qing TaoICLR 2021 · 17 citations
- Adaptive Momentum by Momentum for Deep Neural Network TrainingTao Sun, Huaming Ling, Zuoqiang Shi, Dongsheng Li et al.KDD 2026 · 1 citation
- Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad GeneralizationJingrong Wei, Long ChenICLR 2025
- Dynamics of Stochastic Momentum Methods on Large-scale, Quadratic ModelsCourtney Paquette, Elliot PaquetteNeurIPS 2021 · 20 citations
- A Modular Analysis of Provable Acceleration via Polyak's Momentum: Training a Wide ReLU Network and a Deep Linear NetworkJun-Kun Wang, Chi-Heng Lin, Jacob D. AbernethyICML 2021 · 26 citations
