mlsanityData to 14 Oct 2026

Through the River: Understanding the Benefit of Schedule-Free Methods for Language Model Training

arXiv 2507.09846 ↗First posted 14 Jul 2025cs.LG cs.AI math.OCcited by 9

Not on the map. Why?

Abstract (arXiv)

As both model and dataset sizes continue to scale rapidly, conventional pretraining strategies with fixed compute budgets-such as cosine learning rate schedules-are increasingly inadequate for large-scale training. Recent alternatives, including warmup-stable-decay (WSD) schedules and weight averaging, offer greater flexibility. However, WSD relies on explicit decay phases to track progress, while weight averaging addresses this limitation at the cost of additional memory. In search of a more principled and scalable alternative, we revisit the Schedule-Free (SF) method [Defazio et al., 2024], which has shown strong empirical performance across diverse settings. We show that SF-AdamW effectively navigates the "river" structure of the loss landscape without decay phases or auxiliary averaging, making it particularly suitable for continuously scaling training workloads. To understand this behavior, we conduct a theoretical and empirical analysis of SF dynamics, revealing that it implicitly performs weight averaging without memory overhead. Guided by this analysis, we propose a refined variant of SF that improves robustness to momentum and performs better under large batch sizes, addressing key limitations of the original method. Together, these results establish SF as a practical, scalable, and theoretically grounded approach for language model training.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 34 of its 42 references that are in the map. First posted on arXiv 14 Jul 2025.

Builds on

34 of 42 references.

References · 34

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  3. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  4. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  5. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  6. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  7. 2020GLU Variants Improve Transformercited by 1,804
  8. 2019Root Mean Square Layer Normalizationcited by 1,480
  9. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  10. 2021Scaling Vision Transformerscited by 999
  11. 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
  12. 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
22 more
  1. 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 170
  2. 2024The Road Less Scheduledcited by 163
  3. 2022Self-Stabilization: The Implicit Bias of Gradient Descent at the Edge of Stabilitycited by 155
  4. 2022Understanding Gradient Descent on Edge of Stability in Deep Learningcited by 128
  5. 2022Adaptive Gradient Methods at the Edge of Stabilitycited by 101
  6. 2018A Walk with SGDcited by 78
  7. 2024How Does Critical Batch Size Scale in Pre-training?cited by 73
  8. 2024Understanding Optimization in Deep Learning with Central Flowscited by 64
  9. 2022Analyzing Sharpness along GD Trajectory: Progressive Sharpening and Edge of Stabilitycited by 63
  10. 2022Understanding Edge-of-Stability Training Dynamics with a Minimalist Examplecited by 56
  11. 2023Benchmarking Neural Network Training Algorithmscited by 52
  12. 2022Learning threshold neurons via the "edge of stability"cited by 51
  13. 2025Model Merging in Pre-training of Large Language Modelscited by 37
  14. 2024Does SGD really happen in tiny subspaces?cited by 36
  15. 2025Accelerating Neural Network Training: An Analysis of the AlgoPerf Competitioncited by 32
  16. 2023Trajectory Alignment: Understanding the Edge of Stability Phenomenon via Bifurcation Theorycited by 26
  17. 2024Adam with model exponential moving average is effective for nonconvex optimizationcited by 23
  18. 2025A Multi-Power Law for Loss Curve Prediction Across Learning Rate Schedulescited by 22
  19. 2023Training trajectories, mini-batch losses and the curious role of the learning ratecited by 21
  20. 2024General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimizationcited by 15
  21. 2024Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growthcited by 10
  22. 2025Connections between Schedule-Free Optimizers, AdEMAMix, and Accelerated SGD Variantscited by 10

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 7.

9 papers.