Skaling: Chinchilla's Exponents Meet Kaplan's Coupling

Hugging Face Daily Papers Papers

Summary

The paper introduces the Skaling law, a generalized neural scaling law that couples model capacity and data through an interaction exponent, reducing prediction error by 1.5-3x and enabling full-grid extrapolation using roughly 10x less compute.

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.
Original Article
View Cached Full Text

Cached at: 08/10/26, 06:14 AM

Paper page - Skaling: Chinchilla’s Exponents Meet Kaplan’s Coupling

Source: https://huggingface.co/papers/2608.07222

Abstract

Neuralscalinglawsarefoundationalforlanguagemodeldevelopment,yetstandardformulationssystematicallyunder-andoverestimatelossatdata-scarceandovertrainingextremes.Thisfailureoriginatesintheunderlyingassumptionthatmodelsizeandtrainingdataimpactthelossindependently.Toaddressthis,weintroducetheSkalinglaw,ageneralizedfunctionalformthatcouplesmodelcapacityanddatathroughasingleinteractionexponent.ThissimpleextensionreducestheMeanAbsolutePercentageError(MAPE)by1.5-3xacrossbothinterpolationandextrapolationregimes.Whenpairedwithasparsegridstrategyrestrictedtolow-computeregimes,theSkalinglawachievesaccuratefull-gridextrapolationusingapproximately10xlesscomputethanuniformsweeps.Byenablingreliableperformancepredictionfromsmall-scaleexperiments,theSkalinglawprovidesamorerobustandresource-efficientframeworkforallocatingcomputebudgetsinnext-generationmodeltraining.

View arXiv pageView PDFAdd to collection

Get this paper in your agent:

hf papers read 2608\.07222

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2608.07222 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2608.07222 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2608.07222 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

Unified Neural Scaling Laws

arXiv cs.LG

This paper presents Unified Neural Scaling Laws (UNSL), a functional form that accurately models and extrapolates deep neural network scaling behaviors as multiple dimensions such as parameters, data, and steps vary simultaneously, improving over previous scaling laws.

Unified Neural Scaling Laws

Hugging Face Daily Papers

Presents a unified neural scaling law that accurately models deep neural network scaling across multiple dimensions including parameters, dataset size, training steps, and compute, validated across diverse architectures and tasks.