Scaling transition from momentum stochastic gradient descent to plain stochastic gradient descent
Not on the map. Why?
Abstract (arXiv)
The plain stochastic gradient descent and momentum stochastic gradient descent have extremely wide applications in deep learning due to their simple settings and low computational complexity. The momentum stochastic gradient descent uses the accumulated gradient as the updated direction of the current parameters, which has a faster training speed. Because the direction of the plain stochastic gradient descent has not been corrected by the accumulated gradient. For the parameters that currently need to be updated, it is the optimal direction, and its update is more accurate. We combine the advantages of the momentum stochastic gradient descent with fast training speed and the plain stochastic gradient descent with high accuracy, and propose a scaling transition from momentum stochastic gradient descent to plain stochastic gradient descent(TSGD) method. At the same time, a learning rate that decreases linearly with the iterations is used instead of a constant learning rate. The TSGD algorithm has a larger step size in the early stage to speed up the training, and training with a smaller step size in the later stage can steadily converge. Our experimental results show that the TSGD algorithm has faster training speed, higher accuracy and better stability. Our implementation is available at: https://github.com/kunzeng/TSGD.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 26 references that are in the map. First posted on arXiv 12 Jun 2021.
Builds on
13 of 26 references.
References · 13
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2019On the Convergence of Adam and Beyondcited by 841
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2014Analysis and Design of Optimization Algorithms via Integral Quadratic Constraintscited by 105
- 2014Global convergence of the Heavy-ball method for convex optimizationcited by 61
- 2017Momentum and Stochastic Momentum for Stochastic Gradient, Newton, Proximal Point and Subspace Descent Methodscited by 49
- 2018On the insufficiency of existing momentum schemes for Stochastic Optimizationcited by 49
- 2018Quasi-hyperbolic momentum and Adam for deep learningcited by 48
- 2019Understanding the Role of Momentum in Stochastic Gradient Methodscited by 44
- 2019Reducing the variance in online optimization by transporting past gradientscited by 12
1 more
- 2019On the Convergence of AdaBound and its Connection to SGDcited by 3
Built on by
Citing papers per year: 2023: 1.
1 paper.