2025· Neural Information Processing Systems· pp. 133685-133727· 4 citations· ⚡ 1 influential· 47 references
Computer Science
TL;DR
This work introduces Farseer, a novel and refined scaling law offering enhanced predictive accuracy across scales, and provides new insights into optimal compute allocation, better reflecting the nuanced demands of modern LLM training.
Abstract
Training Large Language Models (LLMs) is prohibitively expensive, creating a critical scaling gap where insights from small-scale experiments often fail to transfer to resource-intensive production systems, thereby hindering efficient innovation. To bridge this, we introduce Farseer , a novel and refined scaling law offering enhanced predictive accuracy across scales. By systematically constructing a model loss surface L ( N, D ) , Farseer achieves a significantly better fit to empirical data than prior laws (e.g., Chinchilla’s law ). Our methodology yields accurate, robust, and highly generalizable predictions, demonstrating excellent extrapolation capabilities, outperforming Chinchilla’s law, whose extrapolation error is 433% higher. This allows for the reliable evaluation of competing training strategies across all ( N, D ) settings, enabling conclusions from small-scale ablation studies to be confidently extrapolated to predict large-scale performance. Furthermore, Farseer provides new insights into optimal compute allocation, better reflecting the nuanced demands of modern LLM training. To validate our approach, we trained an extensive suite of approximately 1,000 LLMs across diverse scales and configurations, consuming roughly 3 million NVIDIA H100 GPU hours. To foster further research, we are comprehensively open-sourcing all code, data, results 3 , all training logs 4 , all models used in scaling law fitting 5 .
This analysis reveals that intermediate log-probability is an unreliable indicator for reasoning capability; instead, reasoning performance results from a shift of internal confidence allocation where RL fine-tuning delays internal convergence, exhibiting prolonged mid-layer exploration before converging sharply at the...
Pablo Pérez-Lázaro, Rocío Aznar-Gimeno, F. J. Lacueva-Pérez et al.· 0 citations
A compute-efficient, two-step hyperparameter transfer framework that estimates optimal learning rates for training large MoE models by transferring them across scaling model widths, and subsequently extrapolating to trillion-token horizons is proposed.
Nayeon Kim, Hojin Lee, Yunju Bak et al.· 0 citations
Scaling laws promised cost-effective experiments; six years later, they have yet to fully deliver. Instead, researchers have found them unreliable at small scales (starting at 4M parameters) and concluded that sizable models cannot be avoided. We show this is not the case: the confounding factor is hyperparameters. Sma...
Nicholas Lourie, Kyunghyun Cho, Karen Ullrich et al.· 1 citation
This work proposes maximizing the entropy of predictive distributions as the calibration objective, which directly targets overconfidence by discouraging overly concentrated predictions, and adopts an efficient first-order approximation that avoids explicit second-order computation.
Ruochen Jin, Zhanliang Wang, Zong-Yu Dai et al.· 0 citations
This work systematically characterize how optimization hyperparameters, compute allocation, and architecture scale for MoE dLLMs, identifying quantitative differences from scaling trends previously reported for AR models.
Fengqi Zhu, Shaoxuan Xu, Jingyang Ou et al.· 1 citation
Direct transfer of Step Law systematically overestimates the optimal learning rate: the median ratio eta_SL / eta* is approximately 4.0x, with a range of 2.4x to 6.6x.
Egor Romanyukov, Timofey Novikov, Timur Shokarov et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.