Optimal Learning Rate Schedules under Functional Scaling Laws: Power Decay and Warmup-Stable-Decay
Not on the map. Why?
Abstract (arXiv)
We study optimal learning rate (LR) schedules under the functional scaling law (FSL) framework (Li et al., 2025), which decomposes training dynamics into signal learning and noise forgetting. In power-law kernel regression, these two components are governed by a source exponent s>0 and a capacity exponent q>1, respectively, with smaller s corresponding to harder tasks. For a fixed training horizon N, we characterize the schedules that minimize the final-step loss under a stability constraint and reveal a sharp phase transition. In the easy-task regime s>1-1/q, the optimal schedule follows power decay from the beginning of training; in the hard-task regime s<1-1/q, it becomes warmup-stable-decay (WSD)-like (Hu et al., 2024), staying at the largest admissible LR for most of training before a final decay. In both regimes, the decay exponent is 2q-1: task difficulty determines when to decay, while model capacity determines how to decay. Beyond the exact optimum, we study fractional schedules, whose shape is defined over relative training progress. We show that precise tuning of the decay shape is often unnecessary: a broad class of profiles attains the optimal convergence rate, while overly slow terminal decay leads to schedule-induced capacity saturation. Finally, for one-pass SGD in kernel regression, FSL-motivated power-decay schedules achieve optimal last-iterate rates. Experiments support the theoretical predictions and the task-dependent transition between early and delayed decay.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 50 of its 66 references that are in the map. First posted on arXiv 6 Feb 2026.
Builds on
50 of 66 references.
References · 50
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2021Scaling Vision Transformerscited by 993
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 694
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 510
- 2023Scaling Data-Constrained Language Modelscited by 391
- 2021Explaining Neural Scaling Lawscited by 353
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 160
38 more
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
- 2023Scaling Laws for Generative Mixed-Modal Language Modelscited by 131
- 2013Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)cited by 110
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
- 2024A Dynamical Model of Neural Scaling Lawscited by 105
- 2022A Solvable Model of Neural Scaling Lawscited by 101
- 2024Scaling Laws for Precisioncited by 92
- 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 87
- 2024Understanding Warmup-Stable-Decay Learning Rates: A River Valley Loss Landscape Perspectivecited by 75
- 2018Statistical Optimality of Stochastic Gradient Descent on Hard Learning Problems through Multiple Passescited by 69
- 2019The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squarescited by 67
- 20244+3 Phases of Compute-Optimal Neural Scaling Lawscited by 66
- 2016Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regressioncited by 64
- 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
- 2024Scaling Laws in Linear Regression: Compute, Parameters, and Datacited by 54
- 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 53
- 2023The Implicit Regularization of Dynamical Stability in Stochastic Gradient Descentcited by 44
- 2023Optimal Linear Decay Learning Rate Schedules and Further Refinementscited by 41
- 2021Last Iterate Risk Bounds of SGD with Decaying Stepsize for Overparameterized Linear Regressioncited by 37
- 2025Straight to Zero: Why Linearly Decaying the Learning Rate to Zero Works Best for LLMscited by 34
- 2025The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Trainingcited by 31
- 2024Scaling Law with Learning Rate Annealingcited by 29
- 2020A Second look at Exponential and Cosine Step Sizes: Simplicity, Adaptivity, and Performancecited by 26
- 2025A Multi-Power Law for Loss Curve Prediction Across Learning Rate Schedulescited by 22
- 2019Beating SGD Saturation with Tail-Averaging and Minibatchingcited by 21
- 2025Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Lawcited by 19
- 2018Continuous-time Models for Stochastic Optimization Algorithmscited by 16
- 2021Eigencurve: Optimal Learning Rate Schedule for SGD on Quadratic Objectives with Skewed Hessian Spectrumscited by 15
- 2025Functional Scaling Laws in Kernel Regression: Loss Dynamics and Learning Rate Schedulescited by 14
- 2025Larger Datasets Can Be Repeated More: A Theoretical Analysis of Multi-Epoch Scaling in Linear Regressioncited by 12
- 2023A Theoretical Analysis of Noise Geometry in Stochastic Gradient Descentcited by 8
- 2017Fast and Strong Convergence of Online Learning Algorithmscited by 7
- 2023Learning Rate Schedules in the Presence of Distribution Shiftcited by 7
- 2025Improved Scaling Laws in Linear Regression via Data Reusecited by 7
- 2026Muon in Associative Memory Learning: Training Dynamics and Scaling Lawscited by 7
- 2024The Optimality of (Accelerated) SGD for High-Dimensional Quadratic Optimizationcited by 6
- 2023Optimality of Robust Online Learningcited by 5
- 2022Online Regularized Learning Algorithm for Functional Datacited by 2
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Fast Catch-Up, Late Switching: Optimal Batch Size Scheduling via Functional Scaling Lawscited by 4
- 2026Hyperball May Not Be a Free Lunchcited by 3
- 2026Effective Learning Rate Governs Loss Dynamics in Language Model Pretrainingcited by 2
- 2026Same Loss, Same Noise, Opposite Schedules: Noise Structure and Optimizer Normalization Jointly Determine Whether Learning-Rate Cooldown Helpscited by 0
- 2026Effective Learning Rate Governs Loss Dynamics in Language Model Pretraining25 Aug 2026
- 2026Hyperball May Not Be a Free Lunch24 Jul 2026
- 2026Same Loss, Same Noise, Opposite Schedules: Noise Structure and Optimizer Normalization Jointly Determine Whether Learning-Rate Cooldown Helps14 Jul 2026
- 2026Fast Catch-Up, Late Switching: Optimal Batch Size Scheduling via Functional Scaling Laws15 Feb 2026