Spend Less, Fit Better: Budget-Efficient Scaling Law Fitting via Active Experiment Selection
Not on the map. Why?
Abstract (arXiv)
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 propose SL2 (Scaling Laws, Spend Less), 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, SL2 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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 43 references that are in the map. First posted on arXiv 24 Apr 2026.
Builds on
27 of 43 references.
References · 27
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Scaling Laws for Reward Model Overoptimizationcited by 1,056
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 694
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2023Scaling Data-Constrained Language Modelscited by 391
- 2024Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Modelscited by 282
- 2021Scaling Laws for Transfercited by 265
- 2024Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performancecited by 179
- 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 166
- 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 160
15 more
- 2024Scaling Laws with Vocabulary: Larger Models Deserve Larger Vocabulariescited by 113
- 2022Broken Neural Scaling Lawscited by 102
- 2024Resolving Discrepancies in Compute-Optimal Scaling of Language Modelscited by 84
- 2024D-CPT Law: Domain-specific Continual Pre-Training Scaling Law for Large Language Modelscited by 39
- 2024Selecting Large Language Model to Fine-tune via Rectified Scaling Lawcited by 33
- 2025Parallel Scaling Law for Language Modelscited by 29
- 2025(Mis)Fitting: A Survey of Scaling Lawscited by 24
- 2025Scaling Laws for Upcycling Mixture-of-Experts Language Modelscited by 12
- 2025Sample Complexity and Representation Ability of Test-time Scaling Paradigmscited by 12
- 2025Can Language Models Discover Scaling Laws?cited by 12
- 2026On the Width Scaling of Neural Optimizers Under Matrix Operator Norms I: Row/Column Normalization and Hyperparameter Transfercited by 11
- 2024Goal-Oriented Bayesian Optimal Experimental Design for Nonlinear Models using Markov Chain Monte Carlocited by 8
- 2025Predictable Scale: Part II, Farseer: A Refined Scaling Law in Large Language Modelscited by 5
- 2025How to Upscale Neural Networks with Scaling Law? A Survey and Practical Guidelinescited by 4
- 2015Designs for Generalized Linear Modelscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.