Stochastic Normalized Gradient Descent with Momentum for Large-Batch Training
Not on the map. Why?
Abstract (arXiv)
Stochastic gradient descent~(SGD) and its variants have been the dominating optimization methods in machine learning. Compared to SGD with small-batch training, SGD with large-batch training can better utilize the computational power of current multi-core systems such as graphics processing units~(GPUs) and can reduce the number of communication rounds in distributed training settings. Thus, SGD with large-batch training has attracted considerable attention. However, existing empirical results showed that large-batch training typically leads to a drop in generalization accuracy. Hence, how to guarantee the generalization ability in large-batch training becomes a challenging task. In this paper, we propose a simple yet effective method, called stochastic normalized gradient descent with momentum~(SNGM), for large-batch training. We prove that with the same number of gradient computations, SNGM can adopt a larger batch size than momentum SGD~(MSGD), which is one of the most widely used variants of SGD, to converge to an ε-stationary point. Empirical results on deep learning verify that when adopting the same large batch size, SNGM can achieve better test accuracy than MSGD and other state-of-the-art large-batch training methods.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 2; 2026: 3.
9 papers.
- 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
- 2022Automatic Clipping: Differentially Private Deep Learning Made Easier and Strongercited by 87
- 2022Revisiting Outer Optimization in Adversarial Trainingcited by 4
- 2025AdamNX: An Adam improvement algorithm based on a novel exponential decay mechanism for the second-order moment estimatecited by 1
- 2023On the Optimal Batch Size for Byzantine-Robust Distributed Learningcited by 0
- 2024Neural Optimizer Equation, Decay Function, and Learning Rate Schedule Joint Evolutioncited by 0
- 2026Ada2MS: A Hybrid Optimization Algorithm Based on Exponential Mixing of Elementwise and Global Second-Moment Estimatescited by 0
- 2026Muse: Representation Geometry of Muon Beyond Normalized Momentumcited by 0
- 2026MeqMuon: Matrix-Equilibrating Muon for LLM Pretrainingcited by 0
- 2026MeqMuon: Matrix-Equilibrating Muon for LLM Pretraining28 Sep 2026
- 2026Muse: Representation Geometry of Muon Beyond Normalized Momentum16 Jul 2026
- 2026Ada2MS: A Hybrid Optimization Algorithm Based on Exponential Mixing of Elementwise and Global Second-Moment Estimates19 May 2026
- 2025AdamNX: An Adam improvement algorithm based on a novel exponential decay mechanism for the second-order moment estimate17 Nov 2025
- 2025Training Deep Learning Models with Norm-Constrained LMOs11 Feb 2025
- 2024Neural Optimizer Equation, Decay Function, and Learning Rate Schedule Joint Evolution10 Apr 2024
- 2023On the Optimal Batch Size for Byzantine-Robust Distributed Learning23 May 2023
- 2022Revisiting Outer Optimization in Adversarial Training2 Sep 2022
- 2022Automatic Clipping: Differentially Private Deep Learning Made Easier and Stronger14 Jun 2022