mlsanityData to 14 Oct 2026

AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Fly

arXiv 2105.10762 ↗First posted 22 May 2021cs.LG cs.AIcited by 14

Not on the map. Why?

Abstract (arXiv)

The learning rate (LR) schedule is one of the most important hyper-parameters needing careful tuning in training DNNs. However, it is also one of the least automated parts of machine learning systems and usually costs significant manual effort and computing. Though there are pre-defined LR schedules and optimizers with adaptive LR, they introduce new hyperparameters that need to be tuned separately for different tasks/datasets. In this paper, we consider the question: Can we automatically tune the LR over the course of training without human involvement? We propose an efficient method, AutoLRS, which automatically optimizes the LR for each training stage by modeling training dynamics. AutoLRS aims to find an LR applied to every τ steps that minimizes the resulted validation loss. We solve this black-box optimization on the fly by Bayesian optimization (BO). However, collecting training instances for BO requires a system to evaluate each LR queried by BO's acquisition function for τ steps, which is prohibitively expensive in practice. Instead, we apply each candidate LR for only τ'llτ steps and train an exponential model to predict the validation loss after τ steps. This mutual-training process between BO and the loss-prediction model allows us to limit the training steps invested in the BO search. We demonstrate the advantages and the generality of AutoLRS through extensive experiments of training DNNs for tasks from diverse domains using different optimizers. The LR schedules auto-generated by AutoLRS lead to a speedup of 1.22×, 1.43×, and 1.5× when training ResNet-50, Transformer, and BERT, respectively, compared to the LR schedules in their original papers, and an average speedup of 1.31× over state-of-the-art heavily-tuned LR schedules.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 38 of its 59 references that are in the map. First posted on arXiv 22 May 2021.

Builds on

38 of 59 references.

References · 38

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  6. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  7. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  8. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  9. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  10. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  11. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
  12. 2017Mixed Precision Trainingcited by 1,156
26 more
  1. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  2. 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,043
  3. 2018Neural Network Acceptability Judgmentscited by 958
  4. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
  5. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 699
  6. 2015Cyclical Learning Rates for Training Neural Networkscited by 629
  7. 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 470
  8. 2017Population Based Training of Neural Networkscited by 367
  9. 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
  10. 2017How to Escape Saddle Points Efficientlycited by 285
  11. 2017Three Factors Influencing Minima in SGDcited by 273
  12. 2014One weird trick for parallelizing convolutional neural networkscited by 264
  13. 2016Deep Learning without Poor Local Minimacited by 234
  14. 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 234
  15. 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 226
  16. 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 221
  17. 2018A System for Massively Parallel Hyperparameter Tuningcited by 202
  18. 2018Flipout: Efficient Pseudo-Independent Weight Perturbations on Mini-Batchescited by 133
  19. 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 118
  20. 2018A Closer Look at Deep Learning Heuristics: Learning rate restarts, Warmup and Distillationcited by 110
  21. 2014Freeze-Thaw Bayesian Optimizationcited by 90
  22. 2018Understanding Short-Horizon Bias in Stochastic Meta-Optimizationcited by 69
  23. 2020Provably Efficient Online Hyperparameter Optimization with Population-Based Banditscited by 63
  24. 2018Towards Automated Deep Learning: Efficient Joint Neural Architecture and Hyperparameter Searchcited by 38
  25. 2015Probabilistic Line Searches for Stochastic Optimizationcited by 29
  26. 2018Step Size Matters in Deep Learningcited by 19

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 4; 2024: 2; 2025: 2; 2026: 2.

14 papers.

Sort:

By area: