Skaling: Chinchilla's Exponents Meet Kaplan's Coupling
Mirrored from Hugging Face Daily Papers for archival readability. Support the source by reading on the original site.
Abstract
Neural scaling laws are foundational for language model development, yet standard formulations systematically under- and overestimate loss at data-scarce and overtraining extremes. This failure originates in the underlying assumption that model size and training data impact the loss independently. To address this, we introduce the Skaling law, a generalized functional form that couples model capacity and data through a single interaction exponent. This simple extension reduces the Mean Absolute Percentage Error (MAPE) by 1.5-3x across both interpolation and extrapolation regimes. When paired with a sparse grid strategy restricted to low-compute regimes, the Skaling law achieves accurate full-grid extrapolation using approximately 10x less compute than uniform sweeps. By enabling reliable performance prediction from small-scale experiments, the Skaling law provides a more robust and resource-efficient framework for allocating compute budgets in next-generation model training.
Get this paper in your agent:
hf papers read 2608.07222 curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper
No model linking this paper
Datasets citing this paper
No dataset linking this paper
Spaces citing this paper
No Space linking this paper
Collections including this paper
No Collection including this paper
More from Hugging Face Daily Papers
-
Luce: Relightable Gaussians for 3D Asset Generation
Aug 29
-
CritICL: Inference-Time Weak-to-Strong Generalization from Small Language Model Failure Modes
Aug 28
-
What Does an Evaluation License? A Commit-Bound Census of Claim-Relative Inference in Inspect Evals
Aug 28
-
EditaLive! Unified Character Video Editing for Live Streaming
Aug 28
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.