Anytime Pretraining: Horizon-Free Learning-Rate Schedules with Weight Averaging
Alexandru Meterez, Pranav Ajit Nair, Depen Morwani, Cengiz Pehlevan, Sham Kakade

TL;DR
This paper introduces horizon-free, anytime learning rate schedules combined with weight averaging for large language model pretraining, providing theoretical guarantees and practical effectiveness comparable to traditional cosine schedules.
Contribution
It offers the first theoretical analysis of anytime schedules for overparameterized linear regression and demonstrates their practical viability in large language model training.
Findings
Anytime schedules achieve comparable final loss to cosine decay.
Weight averaging enhances the effectiveness of horizon-free schedules.
Empirical results on 150M and 300M parameter models support the approach.
Abstract
Large language models are increasingly trained in continual or open-ended settings, where the total training horizon is not known in advance. Despite this, most existing pretraining recipes are not anytime: they rely on horizon-dependent learning rate schedules and extensive tuning under a fixed compute budget. In this work, we provide a theoretical analysis demonstrating the existence of anytime learning schedules for overparameterized linear regression, and we highlight the central role of weight averaging - also known as model merging - in achieving the minimax convergence rates of stochastic gradient descent. We show that these anytime schedules polynomially decay with time, with the decay rate determined by the source and capacity conditions of the problem. Empirically, we evaluate 150M and 300M parameter language models trained at 1-32x Chinchilla scale, comparing constant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Topic Modeling · Stochastic Gradient Optimization Techniques
