Learning Rate Scheduling
Overview
Learning rate scheduling studies how the size of each optimization update should change over training, since it affects stability, training speed, and the model ultimately learned. Common approaches include warmup followed by cosine or linear decay, step decay and restarts, power-law schedules, and adaptive or schedule-free methods that respond to loss, gradient norms, or other training signals. Researchers evaluate these methods in settings from convex and stochastic optimization theory to image benchmarks and large language model pretraining, where training horizon, batch size, optimizer, and model scale can all matter. A central open tension is whether robust schedules can work across tasks without extensive tuning, or whether the best schedule must adapt to the model, data, noise, and training horizon.
Latest papers
60 papers10 papers in the last four weeks, down 9% on the four weeks before. 0.1% of all new papers.