Optimizer dependence of the three-term scaling law

Investigate how changing the optimization algorithm (for example, replacing AdamW with Muon) affects the fitted parameters and predictions of the three-term scaling law L(N,M,K) = E + A/N^alpha + B/M^beta + C/K^gamma, including the resulting optimal batch-size scaling.

Background

All analyses in the paper use training runs based on AdamW, and the proposed three-term law is fitted under that optimizer. Prior work suggests that alternative optimizers such as Muon can support substantially larger batch sizes, which could alter the scaling behavior the law aims to capture.

The authors explicitly note that assessing optimizer effects on the three-term law is left for future work, highlighting a concrete open direction to test the robustness of the scaling law under different optimization algorithms.

References

Optimal batch size scaling might be optimizer-dependent; in particular, it has been shown that the Muon optimizer \citep{Jordan2024} allows for larger batch sizes \citep{EssentialAI2025}. Investigating how switching the optimizer affects the fitted three-term law remains future work.

How to Allocate Your Tokens? Scaling Laws with Training Steps and Batch Size  (2607.01487 - Schaipp, 1 Jul 2026) in Section: Limitations