Learning-Rate Scheduling for Neural Network Training: A Scoping Review of ReduceLROnPlateau, Cosine Annealing with Warm Restarts, Cyclical Learning Rates, and Linear Warmup with Linear Decay
Keywords:
Adaptive learning rate, cosine annealing, cyclical learning rates, deep learning optimization, ReduceLROnPlateau, stochastic gradient descent, Learning-rate warmupAbstract
This scoping review presents a structured synthesis of learning-rate scheduling for neural network training. The learning rate is a consequential hyperparameter in gradient based neural network training because it mediates the trade-off between early exploration and late-stage convergence precision. The review focuses on four widely used learning-rate scheduling paradigms: (1) ReduceLROnPlateau (RLROP), a feedback-driven reactive scheduler; (2) Stochastic Gradient Descent with Warm Restarts (SGDR), a periodic cosine-shaped schedule; (3) Cyclical Learning Rates (CLR), an oscillatory triangular or exponential schedule; and (4) Linear Warmup with Linear Decay (LW+LD), a two-phase schedule widely used with transformer models. We use a common notation as a pedagogical organizing device, distinguish formal results from empirical tendencies and heuristic analogies, and summarize how each method relates to classical step-size conditions and adaptive-optimizer stability. The quantitative tables are explicitly treated as heterogeneous literature summaries rather than controlled head-to-head benchmarks; they are retained only to document source-specific evidence and practical signals. The article includes a scoping-search log, a quality-assessment rubric, caveats on benchmark comparability, hyperparameter-sensitivity diagnostics, failure-mode checks, and an AI tool usage and human contribution statement. The resulting scheduler-selection framework is intended as practical guidance, not as a statistically ranked performance claim.
References
[1] I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning. Cambridge, MA: MIT Press, 2016. ISBN: 978-0-262-03561-3. [Online]. Available: https://www.deeplearningbook.org/
[2] Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature, vol. 521, pp. 436–444, May 2015. DOI: 10.1038/nature14539
[3] Y. N. Dauphin, R. Pascanu, C. Gulcehre, K. Cho, S. Ganguli, and Y. Bengio, “Identifying and attacking the saddle point problem in high-dimensional non-convex optimization,” in Advances in Neural Information Processing Systems (NIPS), vol. 27, 2014. arXiv: 1406.2572
[4] H. Robbins and S. Monro, “A stochastic approximation method,” The Annals of Mathematical Statistics, vol. 22, no. 3, pp. 400–407, Sep. 1951. DOI: 10.1214/aoms/1177729586
[5] I. Loshchilov and F. Hutter, “SGDR: Stochastic gradient descent with warm restarts,” in Proc. ICLR, 2017. arXiv: 1608.03983
[6] L. N. Smith, “Cyclical learning rates for training neural networks,” in Proc. IEEE WACV, 2017, pp. 464–472. DOI: 10.1109/WACV.2017.58
[7] J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova, “BERT: Pre-training of deep bidirectional transformers for language understanding,” in Proc. NAACL-HLT, 2019, pp. 4171–4186. DOI: 10.18653/v1/N19-1423
[8] F. Chollet et al., “Keras,” GitHub, 2015. [Online]. Available: https://github.com/keras-team/keras
[9] A. Paszke et al., “PyTorch: An imperative style, high-performance deep learning library,” in Advances in Neural Information Processing Systems (NeurIPS), vol. 32, 2019. arXiv: 1912.01703
[10] L. Bottou, “Stochastic gradient descent tricks,” in Neural Networks: Tricks of the Trade, 2nd ed. Berlin: Springer, 2012, pp. 421–436. DOI: 10.1007/978-3-642-35289-8_25
[11] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. IEEE CVPR, 2016, pp. 770–778. DOI: 10.1109/CVPR.2016.90
[12] J. Duchi, E. Hazan, and Y. Singer, “Adaptive subgradient methods for online learning and stochastic optimization,” J. Mach. Learn. Res. (JMLR), vol. 12, pp. 2121–2159, 2011. [Online]. Available: https://jmlr.org/papers/v12/duchi11a.html
[13] T. Tieleman and G. Hinton, “Lecture 6.5 - RMSprop,” in Neural Networks for Machine Learning, Coursera, 2012.
[14] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in Proc. ICLR, 2015. arXiv: 1412.6980
[15] I. Loshchilov and F. Hutter, “Decoupled weight decay regularization,” in Proc. ICLR, 2019. arXiv: 1711.05101
[16] S. Ruder, “An overview of gradient descent optimization algorithms,” 2016. arXiv: 1609.04747
[17] S. Hochreiter and J. Schmidhuber, “Flat minima,” Neural Computation, vol. 9, no. 1, pp. 1–42, Jan. 1997. DOI: 10.1162/neco.1997.9.1.1
[18] N. S. Keskar, D. Mudigere, J. Nocedal, M. Smelyanskiy, and P. T. P. Tang, “On large-batch training for deep learning: Generalization gap and sharp minima,” in Proc. ICLR, 2017. arXiv: 1609.04836
[19] G. Huang, Y. Li, G. Pleiss, Z. Liu, J. E. Hopcroft, and K. Q. Weinberger, “Snapshot ensembles: Train 1, get M for free,” in Proc. ICLR, 2017. arXiv: 1704.00109
[20] L. N. Smith and N. Topin, “Super-convergence: Very fast training of neural networks using large learning rates,” in Proc. SPIE 11006, Artif. Intell. Mach. Learn. Multi-Domain Oper. Appl., 1100612, 2019. DOI: 10.1117/12.2520589
[21] L. Liu et al., “On the variance of the adaptive learning rate and beyond,” in Proc. ICLR, 2020. arXiv: 1908.03265
[22] A. Vaswani et al., “Attention is all you need,” in Advances in Neural Information Processing Systems (NeurIPS), vol. 30, 2017. arXiv: 1706.03762
[23] A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” Tech. Rep., Univ. of Toronto, 2009. [Online]. Available: https://www.cs.toronto.edu/~kriz/learning-features-2009-TR.pdf
[24] S. Zagoruyko and N. Komodakis, “Wide residual networks,” in Proc. BMVC, 2016. DOI: 10.5244/C.30.87
[25] D. Choi et al., “On empirical comparisons of optimizers for deep learning,” 2019. arXiv: 1910.05446
[26] M. E. Peters et al., “Deep contextualized word representations,” in Proc. NAACL-HLT, 2018, pp. 2227-2237. DOI: 10.18653/v1/N18-1202
[27] A. Radford, K. Narasimhan, T. Salimans, and I. Sutskever, “Improving language understanding by generative pre-training,” OpenAI, 2018. [Online]. Available: https://cdn.openai.com/research-covers/language-unsupervised/language_understanding_paper.pdf
[28] C. Raffel et al., “Exploring the limits of transfer learning with a unified text-to-text transformer,” J. Mach. Learn. Res. (JMLR), vol. 21, no. 140, pp. 1–67, 2020. arXiv: 1910.10683
[29] M. J. Page et al., “The PRISMA 2020 statement: an updated guideline for reporting systematic reviews,” BMJ, 2021;372:n71. DOI: 10.1136/bmj.n71
[30] O. Russakovsky et al., “ImageNet large scale visual recognition challenge,” Int. J. Comput. Vis. (IJCV), vol. 115, no. 3, pp. 211–252, 2015. DOI: 10.1007/s11263-015-0816-y
[31] Y. You et al., “Large batch optimization for deep learning: Training BERT in 76 minutes,” in Proc. ICLR, 2020. arXiv: 1904.00962
[32] A. Wang et al., “GLUE: A multi-task benchmark and analysis platform for natural language understanding,” in Proc. ICLR, 2019. arXiv: 1804.07461
[33] L. N. Smith, “A disciplined approach to neural network hyper-parameters,” NRL Tech. Rep. 5510-026, 2018. arXiv: 1803.09820
Additional Files
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 SPGE Illukkumbura

This work is licensed under a Creative Commons Attribution 4.0 International License.