AutoDrop: Training Deep Learning Models with Automatic Learning Rate Drop
Not on the map. Why?
Abstract (arXiv)
Modern deep learning (DL) architectures are trained using variants of the SGD algorithm that is run with a textitmanually defined learning rate schedule, i.e., the learning rate is dropped at the pre-defined epochs, typically when the training loss is expected to saturate. In this paper we develop an algorithm that realizes the learning rate drop textitautomatically. The proposed method, that we refer to as AutoDrop, is motivated by the observation that the angular velocity of the model parameters, i.e., the velocity of the changes of the convergence direction, for a fixed learning rate initially increases rapidly and then progresses towards soft saturation. At saturation the optimizer slows down thus the angular velocity saturation is a good indicator for dropping the learning rate. After the drop, the angular velocity "resets" and follows the previously described pattern - it increases again until saturation. We show that our method improves over SOTA training approaches: it accelerates the training of DL models and leads to a better generalization. We also show that our method does not require any extra hyperparameter tuning. AutoDrop is furthermore extremely simple to implement and computationally cheap. Finally, we develop a theoretical framework for analyzing our algorithm and provide convergence guarantees.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 53 references that are in the map. First posted on arXiv 30 Nov 2021.
Builds on
27 of 53 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
- 2016Wide Residual Networkscited by 3,057
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 688
- 2015Cyclical Learning Rates for Training Neural Networkscited by 627
- 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 466
- 2017Population Based Training of Neural Networkscited by 351
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 333
15 more
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 232
- 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 223
- 2019SGD: General Analysis and Improved Ratescited by 206
- 2018A System for Massively Parallel Hyperparameter Tuningcited by 201
- 2017Super-Convergence: Very Fast Training of Neural Networks Using Large Learning Ratescited by 196
- 2013Minimizing Finite Sums with the Stochastic Average Gradientcited by 164
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 117
- 2019Fast Convergence of Natural Gradient Descent for Overparameterized Neural Networkscited by 76
- 2020Provably Efficient Online Hyperparameter Optimization with Population-Based Banditscited by 61
- 2018Towards Automated Deep Learning: Efficient Joint Neural Architecture and Hyperparameter Searchcited by 38
- 2016Unified Convergence Analysis of Stochastic Momentum Methods for Convex and Non-convex Optimizationcited by 34
- 2019Global Convergence of Adaptive Gradient Methods for An Over-parameterized Neural Networkcited by 27
- 2018WNGrad: Learn the Learning Rate in Gradient Descentcited by 24
- 2019A Generalized Framework for Population Based Trainingcited by 22
- 2021AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Flycited by 14
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.