Why Do We Need Warm-up? A Theoretical Perspective
Not on the map. Why?
Abstract (arXiv)
Learning rate warm-up -- increasing the learning rate at the beginning of training -- has become a ubiquitous heuristic in modern deep learning, yet its theoretical foundations remain poorly understood. In this work, we provide a principled explanation for why warm-up improves training. We rely on a generalization of the (L0, L1)-smoothness condition, which bounds local curvature as a linear function of the loss suboptimality and exhibits desirable closure properties. We show -- both theoretically and empirically -- that this condition is satisfied by common neural architectures and accurately captures the curvature of the optimization landscape early in training. Adapting the learning rate in response to this curvature condition naturally induces a warm-up-like schedule, and we show that this choice yields provably faster convergence guarantees than using a fixed learning rate. Experiments on language and vision models show that the resulting one-parameter warm-up schedule can match tuned linear warm-up and improve over no warm-up.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Oct 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 8.
8 papers.
- 2026Non-Euclidean Gradient Descent Operates at the Edge of Stabilitycited by 9
- 2026On the Role of Batch Size in Stochastic Conditional Gradient Methodscited by 7
- 2026Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizerscited by 5
- 2026Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptionscited by 1
- 2026Self-Play Enhancement via Advantage-Weighted Refinement in Online Federated LLM Fine-Tuning with Real-Time Feedbackcited by 1
- 2026Convergence of Steepest Descent and Adam under Non-Uniform Smoothnesscited by 1
- 2026Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothnesscited by 0
- 2026Balancing Early Performance Sacrifices with Long-Term Gains: Scaling Learning-Rate Warmup Duration Across Training Horizonscited by 0
- 2026Balancing Early Performance Sacrifices with Long-Term Gains: Scaling Learning-Rate Warmup Duration Across Training Horizons27 Sep 2026
- 2026Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness11 Aug 2026
- 2026Convergence of Steepest Descent and Adam under Non-Uniform Smoothness28 May 2026
- 2026Self-Play Enhancement via Advantage-Weighted Refinement in Online Federated LLM Fine-Tuning with Real-Time Feedback8 May 2026
- 2026Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions24 Mar 2026
- 2026On the Role of Batch Size in Stochastic Conditional Gradient Methods22 Mar 2026
- 2026Non-Euclidean Gradient Descent Operates at the Edge of Stability5 Mar 2026
- 2026Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers5 Feb 2026