← 返回论文检索
ICML 2026PosterAccept (regular)

Deriving Neural Scaling Laws from the Statistics of Natural Language

Francesco Cagnetta, Allan Raventos, Surya Ganguli, Matthieu Wyart

Simplex · Stanford University · Stanford

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。

摘要

Despite the fact that experimental neural scaling laws have substantially guided empirical progress in large-scale machine learning, no existing theory can quantitatively predict the exponents of these important laws for any modern LLM trained on any natural language dataset. We provide the first such theory in the case of data-limited scaling laws. We isolate two key statistical properties of language that {\it alone} can predict neural scaling exponents: (i) the decay of pairwise token correlations with time separation between token pairs, and (ii) the decay of the next-token conditional entropy with the length of the conditioning context. We further derive a simple formula in terms of these statistics that predicts data-limited neural scaling exponents from first principles {\it without any} free parameters or synthetic data models. Our theory exhibits a remarkable match with experimentally measured neural scaling laws obtained from training GPT-2 and LLaMA style models from scratch on two qualitatively different benchmarks, TinyStories and WikiText.