Learning Rate Engineering: From Coarse Single Parameter to Layered Evolution
Not on the map. Why?
Abstract (arXiv)
Learning rate scheduling has evolved from the single global fixed rate of early SGD to sophisticated layer-wise adaptive strategies. We systematize this evolution into five generations: (Gen1) global fixed learning rates, (Gen2) global scheduling, (Gen3) parameter-level adaptation, (Gen4) layer-level differentiation, and (Gen5) joint layer-time scheduling. We trace the fundamental motivation behind each transition, showing how the shift from one-size-fits-all to tailoring by layer and time addresses the impossible trinity of transfer learning: lower layers require small updates to preserve general knowledge while higher layers need large updates to adapt to new tasks. Building on this taxonomy, we propose Discriminative Adaptive Layer Scaling (DALS), a unified framework that integrates phase-adaptive cosine scheduling, depth-aware Grokfast gradient filtering, and LARS-style trust ratios into a single coherent optimizer. We benchmark 18 strategies including three DALS variants across all five generations on five datasets: synthetic, CIFAR-10 (from scratch), RTE, TREC-6, and IMDb (fine-tuning). On synthetic, DALS achieves the best accuracy at 98.0%, while DALS-Fast reaches 90% in just 3 epochs. The cross-dataset analysis reveals striking regime-dependent patterns -- no single strategy wins across all regimes. Critically, STLR+Discriminative, the ULMFiT champion, catastrophically fails on from-scratch tasks (43.6% on TREC-6 from scratch vs. 96.8% with RAdam), confirming that directional decay biases are harmful without pretrained features. DALS avoids either extreme, achieving the best synthetic result while maintaining competitive fine-tuning performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 18 references that are in the map. First posted on arXiv 30 Apr 2026.
Builds on
13 of 18 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2014How transferable are features in deep neural networks?cited by 1,225
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 772
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 674
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
- 2024The Road Less Scheduledcited by 163
1 more
- 2024Grokfast: Accelerated Grokking by Amplifying Slow Gradientscited by 41
Built on by
Not cited yet.