Back to Deep Learning Mind Map
中文·English
🧠 Deep LearningID: lr-scheduler

Learning Rate Scheduling

学习率调度
🎯Core Definition
LR scheduling changes the learning rate ηt\eta_t over training according to a plan. Four mainstream strategies: ① Warmup (linear): ηt=ηmaxtTwarm\eta_t = \eta_{\max}\cdot\frac{t}{T_{\text{warm}}} for t=1Twarmt = 1 \ldots T_{\text{warm}}, ramping linearly from near zero to the peak ηmax\eta_{\max}; ② linear decay: ηt=ηmax(1tT)\eta_t = \eta_{\max}\left(1 - \frac{t}{T}\right); ③ step decay: ηt=η0γt/s\eta_t = \eta_0\gamma^{\lfloor t/s \rfloor}, multiplying by γ\gamma (e.g. ×0.1) every ss steps; ④ cosine annealing: ηt=ηmin+12(ηmaxηmin)(1+cos(tTπ))\eta_t = \eta_{\min} + \frac{1}{2}(\eta_{\max} - \eta_{\min})\left(1 + \cos\left(\frac{t}{T}\pi\right)\right) — at t=0t=0, η0=ηmax\eta_0 = \eta_{\max}; at t=Tt=T, ηT=ηmin\eta_T = \eta_{\min}, a smooth drop with no cliff. Large-model training standardizes on “warmup + cosine”: 1%–5% of steps ramp linearly to the peak, then cosine decays smoothly to a tiny final value. Why warmup: early in training Adam's vtv_t has seen only a few gradients, so v^t\hat{v}_t is tiny and η/v^t\eta/\sqrt{\hat{v}_t} can be enormous — one step can blow the parameters away (worse with large batches and noisy gradients); a small LR lets the moment estimates and BN/LN statistics stabilize first.
💡Use Cases
a standard component of every SOTA large-model and CNN training pipeline; interview favorites: why warmup is necessary, cosine vs step decay, and the LR–batch-size scaling rule.
Key Problems Solved
a fixed LR faces a dilemma — large LR converges fast early but oscillates or diverges near the optimum, small LR is too slow early; scheduling hard-codes “large steps to explore, small steps to refine”. Cosine annealing approaches a tiny LR smoothly, avoiding the loss spikes of step-decay cliffs, and often lands in flatter minima with better generalization. Linear scaling rule (Goyal 2017): doubling the batch size roughly doubles the LR (larger batches have less gradient noise, allowing larger effective steps), but only works with warmup, otherwise early steps diverge.
🎯5 High-Frequency Exam Points
1
Write the linear warmup ηt=ηmaxtTwarm\eta_t = \eta_{\max}\cdot\frac{t}{T_{\text{warm}}} and cosine annealing ηt=ηmin+12(ηmaxηmin)(1+cos(tTπ))\eta_t = \eta_{\min} + \frac{1}{2}(\eta_{\max}-\eta_{\min})\left(1+\cos\left(\frac{t}{T}\pi\right)\right); what is ηt\eta_t at t=0t=0 and t=Tt=T?
2
Why is warmup needed at the start? Derive why η/v^t\eta/\sqrt{\hat{v}_t} can be huge early in Adam (only a few gradients have accumulated into v^t\hat{v}_t) and why large batches make it riskier.
3
Cosine annealing vs step decay: why is a smooth decline better (avoiding loss spikes from cliffs)? What does a tiny final LR do (converging to flat minima, better generalization)?
4
Linear scaling rule (Goyal): why does doubling the batch size roughly double the LR? How does gradient noise scale with batch size? Why must warmup accompany it?
5
Typical large-model config: warmup fraction (1%–5%), peak LR, cosine endpoint; how do the schedule and the optimizer (Adam's β2\beta_2, ϵ\epsilon) interact?
Updated 2026-08-12
🎯
Test Your Knowledge: Practice Questions for "Learning Rate Scheduling"
Single choice pitfall questions with instant feedback and mistake tracking.
🚀 Start Card Practice
Previous CardAdam & AdamWNext CardWeight Initialization

🔗 More Deep Learning Knowledge Cards

Activation FunctionsAutograd Compute GraphBatch NormalizationClassic CNN Architectures