A last-iterate convex optimization bound is shown to predict the shape and optimal learning-rate ratios of constant-plus-cooldown (wsd) and cosine schedules for LLM training, with validated learning-rate transfer rules.
Why you don't overfit, and don't need Bayes if you only train for one epoch
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Here, we show that in the data-rich setting where you only train on each datapoint once (or equivalently, you only train for one epoch), standard "maximum likelihood" training optimizes the true data generating process (DGP) loss, which is equivalent to the test loss. Further, we show that the Bayesian model average optimizes the same objective, albeit while taking the expectation over uncertainty induced by finite data. As standard maximum likelihood training in the single-epoch setting optimizes the same objective as Bayesian inference, we argue that we do not expect Bayesian inference to offer any advantages in terms of overfitting or calibration in these settings. This explains the diminishing importance of Bayes in areas such as LLMs, which are often trained with one (or very few) epochs.
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
A last-iterate convex optimization bound is shown to predict the shape and optimal learning-rate ratios of constant-plus-cooldown (wsd) and cosine schedules for LLM training, with validated learning-rate transfer rules.