缩放定律,审慎解读

Scaling Laws, Carefully

翁荔 Lilian Weng · Thinking Machines Lab · 2026-06-24 · Lil'Log ↗

打开互动全文版(逐段中英对照 + 图/公式 + 论文问答)→

摘要 · Abstract

本文回顾了深度学习中的经验缩放定律,这些定律描述了训练损失如何随模型规模、数据集规模和计算量的增加而按幂律关系可预测地下降。文章追溯了从 Amari 等人的早期理论工作、Hestness 等人的实证研究,到 Kaplan 等人对语言模型有影响力的缩放定律,再到修订计算最优分配的 Chinchilla 论文的历史发展。核心争论围绕如何在模型参数和训练数据之间最优分配计算量:Kaplan 等人认为模型规模的增长应快于数据,而 Chinchilla 通过更仔细的实验和三种互补方法得出结论,模型规模和数据应以相同速率扩展,这意味着许多现有大型模型训练不足。文章强调,缩放定律为预测性能和指导大规模模型训练中的资源分配提供了实用框架,关键要点是模型规模与数据之间的最优平衡对效率至关重要。

This article reviews the empirical scaling laws in deep learning, which describe how training loss decreases predictably with increases in model size, dataset size, and compute, following power-law relationships. It traces the historical development from early theoretical work by Amari et al. and empirical studies by Hestness et al., through the influential Kaplan et al. scaling laws for language models, to the Chinchilla paper that revised the compute-optimal allocation. The core debate centers on how to optimally allocate compute between model parameters and training tokens: Kaplan et al. suggested model size should grow faster than data, while Chinchilla, using more careful experiments and three complementary methods, concluded that model size and data should scale at equal rates, implying that many existing large models were undertrained. The article highlights that scaling laws provide a practical framework for predicting performance and guiding resource allocation in large-scale model training, with the key takeaway being that the optimal balance between model size and data is crucial for efficiency.

核心贡献 · Key contributions

局限 · Limitations

论文章节 · Sections(共 12)

阅读逐段中英对照全文 →