Where Do Large Learning Rates Lead Us?
Not on the map. Why?
Abstract (arXiv)
It is generally accepted that starting neural networks training with large learning rates (LRs) improves generalization. Following a line of research devoted to understanding this effect, we conduct an empirical study in a controlled setting focusing on two questions: 1) how large an initial LR is required for obtaining optimal quality, and 2) what are the key differences between models trained with different LRs? We discover that only a narrow range of initial LRs slightly above the convergence threshold lead to optimal results after fine-tuning with a small LR or weight averaging. By studying the local geometry of reached minima, we observe that using LRs from this optimal range allows for the optimization to locate a basin that only contains high-quality minima. Additionally, we show that these initial LRs result in a sparse set of learned features, with a clear focus on those most relevant for the task. In contrast, starting training with too small LRs leads to unstable minima and attempts to learn all features simultaneously, resulting in poor generalization. Conversely, using initial LRs that are too large fails to detect a basin with good solutions and extract meaningful patterns from the data.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 53 of its 71 references that are in the map. First posted on arXiv 29 Oct 2024.
Builds on
53 of 71 references.
References · 53
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2016Layer Normalizationcited by 5,579
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2016Wide Residual Networkscited by 3,057
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2017Mixed Precision Trainingcited by 1,135
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
38 more
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2022How Do Vision Transformers Work?cited by 305
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 292
- 2019A Fourier Perspective on Model Robustness in Computer Visioncited by 288
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2020The large learning rate phase of deep learning: the catapult mechanismcited by 206
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 183
- 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
- 2020The Break-Even Point on Optimization Trajectories of Deep Neural Networkscited by 149
- 2020Implicit Gradient Regularizationcited by 145
- 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
- 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 91
- 2018On the Relation Between the Sharpest Directions of DNN Loss and the SGD Step Lengthcited by 85
- 2018A Walk with SGDcited by 74
- 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 70
- 2022SGD with Large Step Sizes Learns Sparse Featurescited by 66
- 2018Theoretical Analysis of Auto Rate-Tuning by Batch Normalizationcited by 65
- 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
- 2020Catastrophic Fisher Explosion: Early Phase Fisher Matrix Impacts Generalizationcited by 61
- 2021On Linear Stability of SGD and Input-Smoothness of Neural Networkscited by 61
- 2020Reconciling Modern Deep Learning with Traditional Optimization Analyses: The Intrinsic Learning Ratecited by 59
- 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
- 2022Learning threshold neurons via the "edge of stability"cited by 50
- 2021Large Learning Rate Tames Homogeneity: Convergence and Balancing Effectcited by 48
- 2023The Implicit Regularization of Dynamical Stability in Stochastic Gradient Descentcited by 44
- 2023Stochastic Collapse: How Gradient Noise Attracts SGD Dynamics Towards Simpler Subnetworkscited by 38
- 2023Hidden symmetries of ReLU networkscited by 38
- 2020On Learning Rates and Schr"odinger Operatorscited by 33
- 2022Benchopt: Reproducible, efficient and collaborative optimization benchmarkscited by 27
- 2020Wide-minima Density Hypothesis and the Explore-Exploit Learning Rate Schedulecited by 25
- 2023Implicit regularization in Heavy-ball momentum accelerated stochastic gradient descentcited by 25
- 2022Stochastic gradient descent introduces an effective landscape-dependent regularization favoring flat solutionscited by 22
- 2021On the Periodic Behavior of Neural Network Training with Batch Normalization and Weight Decaycited by 20
- 2022Training Scale-Invariant Neural Networks on the Sphere Can Happen in Three Regimescited by 19
- 2023The Implicit Bias of Minima Stability in Multivariate Shallow ReLU Networkscited by 15
- 2023Outliers with Opposing Signals Have an Outsized Effect on Neural Network Optimizationcited by 13
- 2024Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization by Large Step Sizescited by 12
50 most cited of 53 All 53 (JSON)
Built on by
Citing papers per year: 2025: 5; 2026: 1.
6 papers.
- 2025SFT Doesn't Always Hurt General Capabilities: Revisiting Domain-Specific Fine-Tuning in LLMscited by 23
- 2025Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Regioncited by 5
- 2025SGD as Free Energy Minimization: A Thermodynamic View on Neural Network Trainingcited by 4
- 2025How does the optimizer implicitly bias the model merging loss landscape?cited by 2
- 2026Fixed Aggregation Features Can Rival GNNscited by 2
- 2025Can Stationary Distributions of Scale-Invariant Neural Networks Be Described by the Thermodynamics of an Ideal Gas?cited by 0
- 2026Fixed Aggregation Features Can Rival GNNs27 Jan 2026
- 2025Can Stationary Distributions of Scale-Invariant Neural Networks Be Described by the Thermodynamics of an Ideal Gas?10 Nov 2025
- 2025How does the optimizer implicitly bias the model merging loss landscape?6 Oct 2025
- 2025Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Region29 Sep 2025
- 2025SFT Doesn't Always Hurt General Capabilities: Revisiting Domain-Specific Fine-Tuning in LLMs25 Sep 2025
- 2025SGD as Free Energy Minimization: A Thermodynamic View on Neural Network Training29 May 2025