A Stagewise Hyperparameter Scheduler to Improve Generalization
Jianhui Sun, Ying Yang, Guangxu Xun, Aidong Zhang
Abstract
Stochastic gradient descent (SGD) augmented with various momentum variants (e.g. heavy ball momentum (SHB) and Nesterov's accelerated gradient (NAG)) has been the default optimizer for many learning tasks. Tuning the optimizer's hyperparameters is arguably the most time-consuming part of model training. Many new momentum variants, despite their empirical advantage over classical SHB/NAG, introduce even more hyperparameters to tune. Automating the tedious and error-prone tuning is essential for AutoML. This paper focuses on how to efficiently tune a large class of multistage momentum variants to improve generalization. We use the general formulation of quasi-hyperbolic momentum (QHM) and extend "constant and drop'', the widespread learning rate α scheduler where α is set large initially and then dropped every few epochs, to other hyperparameters (e.g. batch size b, momentum parameter β, instant discount factor ν). Multistage QHM is a unified framework which covers a large family of momentum variants as its special cases (e.g. vanilla SGD/SHB/NAG). Existing works mainly focus on scheduling α's decay, while multistage QHM allows additional varying hyperparameters such as b, β, and ν, and demonstrates better generalization ability than only tuning α. Our tuning strategies have rigorous justifications rather than a blind trial-and-error. We theoretically prove why our tuning strategies could improve generalization. We also show the convergence of multistage QHM for general nonconvex objective functions. Our strategies simplify the tuning process and beat competitive optimizers in test accuracy empirically.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c2e30e25-796f-4b13-b6c3-d7c4cde0ec02Cited by top-tier papers3
- Demystify Hyperparameters for Stochastic Optimization with Transferable RepresentationsJianhui Sun, Mengdi Huai, Kishlay Jha, Aidong ZhangKDD 2022 · 5 citations
- HyperTime: Hyperparameter Optimization for Combating Temporal Distribution ShiftsShaokun Zhang, Yiran Wu, Zhonghua Zheng, Qingyun Wu et al.ACM MM 2024 · 2 citations
- Enhance Diffusion to Improve Robust GeneralizationJianhui Sun, Sanchit Sinha, Aidong ZhangKDD 2023 · 1 citation
Builds on3
- An Improved Analysis of Stochastic Gradient Descent with MomentumYanli Liu, Yuan Gao, Wotao YinNeurIPS 2020 · 328 citations
- DeepMV: Multi-View Deep Learning for Device-Free Human Activity RecognitionHongfei Xue, Wenjun Jiang, Chenglin Miao, Fenglong Ma et al.UbiComp 2020 · 64 citations
- Correlation Networks for Extreme Multi-label Text ClassificationGuangxu Xun, Kishlay Jha, Jianhui Sun, Aidong ZhangKDD 2020 · 60 citations
Related papers
- Adaptive Momentum by Momentum for Deep Neural Network TrainingTao Sun, Huaming Ling, Zuoqiang Shi, Dongsheng Li et al.KDD 2026 · 1 citation
- Dynamics of Stochastic Momentum Methods on Large-scale, Quadratic ModelsCourtney Paquette, Elliot PaquetteNeurIPS 2021 · 20 citations
- Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient NoiseRui Pan, Yuxing Liu, Xiaoyu Wang, Tong ZhangICLR 2024 · 10 citations
- Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical PerformanceDimitris Oikonomou, Nicolas LoizouICLR 2025
- Generalized Polyak Step Size for First Order Optimization with MomentumXiaoyu Wang, Mikael Johansson, Tong ZhangICML 2023 · 32 citations
