Learning Rate Adaptation in Stochastic Gradient Descent
By Vassilis P. Plagianakos, George D. Magoulas, Michael N. Vrahatis. 2001
55 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Optimization & Training
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Simon Lacoste-Julien
- Gauthier Gidel
- Issam Hadj Laradji
- Peter Richtárik
- Sharan Vaswani
- Nicolas Loizou
- Mark W. Schmidt
- Atilim Gunes Baydin
In Optimization & Training
- Simon Lacoste-Julien
- Issam Hadj Laradji
- Gauthier Gidel
- Sharan Vaswani
- Nicolas Loizou
- Peter Richtárik
- Mark W. Schmidt
- Aaron Mishkin
Citations in the corpus
- Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates (2019, methodology): “Techniques for setting the step-size automatically in classic SGD methods include using a meta-learning procedure to modify the main stochastic algorithm [6, 80, 69, 2, 57, 80, 71], heuristics to adjust the learning rate on the fly [38, 17, 64, 68], and recent adaptive methods inspired by online lea”
- Online Learning Rate Adaptation with Hypergradient Descent (2017, methodology): “Plagianakos et al. [19, 18] proposed methods using gradient-related information of up to two previous steps in adapting the learning rate.”
- Convolutional Neural Network Based Automatic Object Detection on Aerial Images (2016, methodology): “Since the network converged and overfitted in the first stage, our approach was to reduce the learning rate and use a more adaptive algorithm [22] to facilitate small changes in the fitted function.”