Balancing Learning Rates Across Layers: Exact Two-Step Dynamics and Optimal Scaling in Linear Neural Networks
Not on the map. Why?
Abstract (arXiv)
We study optimal learning-rate selection in two-layer and three-layer linear neural networks trained to learn linear target functions. In particular, we derive the exact closed-form expressions for the gradients and test loss after one and two steps of gradient descent, enabling a precise characterization of early training dynamics. We characterize how learning rates should scale under the gradient approximation in the first two steps, and prove that performing updates with this approximation yields a tractable surrogate loss with a tight, small approximation error. This formulation enables the theoretical analysis of layer-wise learning rates and reveals a distinct early-training regime: test loss can be minimized by unequal learning rates at the initial step, while equal learning rates become optimal in subsequent steps. Our numerical experiments validate the theory and demonstrate the importance of balancing layer-wise learning rates early during training. The code is available at: https://github.com/TDCSZ327/Layer-Balancing.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 49 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
20 of 49 references.
References · 20
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 772
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
- 2017Large Batch Training of Convolutional Networkscited by 535
- 2022Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfercited by 288
- 2018A Convergence Analysis of Gradient Descent for Deep Linear Neural Networkscited by 184
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 137
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 126
- 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 124
8 more
- 2023Tensor Programs VI: Feature Learning in Infinite-Depth Neural Networkscited by 97
- 2020Channel Pruning via Automatic Structure Searchcited by 85
- 2018Universal Language Model Fine-tuning for Text Classificationcited by 52
- 2021Large Learning Rate Tames Homogeneity: Convergence and Balancing Effectcited by 50
- 2025The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Trainingcited by 30
- 2024AlphaLoRA: Assigning LoRA Experts Based on Layer Training Qualitycited by 20
- 2025AlphaDecay: Module-wise Weight Decay for Heavy-Tailed Balancing in LLMscited by 13
- 2024Layer-wise Importance Matters: Less Memory for Better Performance in Parameter-efficient Fine-tuning of Large Language Modelscited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026A Full Adam Theorem for Spectral Heavy-Tail Onsetcited by 0
- 2026A Full Adam Theorem for Spectral Heavy-Tail Onset10 Jul 2026