The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
Audio is streamed directly from the publisher (media.transistor.fm) as published in their RSS feed. Play Podcasts does not host this file. Rights-holders can request removal through the copyright & takedown page.
Show Notes
🤗 Upvotes: 3 | cs.LG, math.OC, stat.ML
Authors:
Fabian Schaipp, Alexander Hägele, Adrien Taylor, Umut Simsekli, Francis Bach
Title:
The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
Arxiv:
http://arxiv.org/abs/2501.18965v1
Abstract:
We show that learning-rate schedules for large model training behave surprisingly similar to a performance bound from non-smooth convex optimization theory. We provide a bound for the constant schedule with linear cooldown; in particular, the practical benefit of cooldown is reflected in the bound due to the absence of logarithmic terms. Further, we show that this surprisingly close match between optimization theory and practice can be exploited for learning-rate tuning: we achieve noticeable improvements for training 124M and 210M Llama-type models by (i) extending the schedule for continued training with optimal learning-rate, and (ii) transferring the optimal learning-rate across schedules.