Spend Less, Fit Better: Budget-Efficient Scaling Law Fitting via Active Experiment Selection

## 📄 2604.22753v1 **作者**: Sijie Li, Shanda Li, Haowei Lin, Weiwei Sun, Ameet Talwalkar **分类**: cs.LG **发表**: 2026-04-24 ### 摘要 Scaling laws are used to plan multi-million-dollar training runs, but fitting those laws can itself cost millions. In modern large-scale workflows, assembling a sufficiently informative set of pilot experiments is already a major budget-allocation problem rather than a routine preprocessing step. We formulate scaling-law fitting as budget-aware sequential experimental design: given a finite pool of runnable experiments with heterogeneous costs, choose which runs to execute so as to maximize extrapolation accuracy in a high-cost target region. We then propose an uncertainty-aware method for sequentially allocating experimental budget toward the runs most useful for target-region extrapolation. Across a diverse benchmark of scaling-law tasks, our method consistently outperforms classical design-based baselines, and often approaches the performance of fitting on the full experimental set while using only about 10% of the total training budget. Our code is available at https://github.com/PlanarG/active-sl. 🔗 arXiv 论文页面 --- 搞大模型训练的人都知道，Scaling Law 是个好东西，但去拟合它本身就能烧掉几百万。这篇论文把这个问题变成了一个"有限预算下最该跑哪些实验"的设计问题——用主动学习挑最值得跑的那 10% 的实验，就能达到原来全量跑的效果，钱包先松了口气。

<< 返回首页