arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.02593cs.LGcs.AImath.OC
收藏

有效前沿:神经缩放定律的统一

Effective Frontiers: A Unification of Neural Scaling Laws

Department of Mathematics and Statistics, Xi'an Jiaotong University(西安交通大学数学与统计学系);Department of Artificial Intelligence, Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学人工智能学院);University of Chinese Academy of Sciences(中国科学院大学);Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences(中国科学院深圳先进技术研究院)

Jiaxuan Zou, Zixuan Gong, Ye Su, Huayi Tang, Yong Liu

AI总结:

本文提出有效前沿框架,统一神经缩放定律,揭示容量、覆盖和优化瓶颈的相互作用,证明Kaplan和Chinchilla定律是同一问题的不同解。

摘要:

神经缩放定律支配着测试损失相对于模型容量(N)、数据量(D)和计算量(C)的预测幂律改进。然而,现有理论解释往往依赖于特定架构或复杂的核方法,缺乏直观的普遍性。在本文中,我们提出了一种统一框架,将一般学习任务抽象为从长尾(齐夫)分布中逐步覆盖模式的过程。我们引入了有效前沿(k_⋆),即在模式排名空间中的一个阈值,将学习到的知识与未学习的尾部分开。我们证明,可约简损失在渐近上由资源依赖的前沿截断的尾部概率质量决定。基于我们的框架,我们推导了N、D和C的精确缩放定律,分别归因于容量、覆盖和优化瓶颈。此外,我们通过Max-Bottleneck原理统一了这些机制,证明Kaplan和Chinchilla缩放定律并非矛盾,而是同一受约束优化问题在不同活跃瓶颈下的均衡解。

英文摘要:

Neural scaling laws govern the prediction power-law improvement of test loss with respect to model capacity ($N$), datasize ($D$), and compute ($C$). However, existing theoretical explanations often rely on specific architectures or complex kernel methods, lacking intuitive universality. In this paper, we propose a unified framework that abstracts general learning tasks as the progressive coverage of patterns from a long-tail (Zipfian) distribution. We introduce the Effective Frontier ($k_\star$), a threshold in the pattern rank space that separates learned knowledge from the unlearned tail. We prove that reducible loss is asymptotically determined by the probability mass of the tail a resource-dependent frontier truncation. Based on our framework, we derive the precise scaling laws for $N$, $D$, and $C$, attributing them to capacity, coverage, and optimization bottlenecks, respectively. Furthermore, we unify these mechanisms via a Max-Bottleneck principle, demonstrating that the Kaplan and Chinchilla scaling laws are not contradictory, but equilibrium solutions to the same constrained optimization problem under different active bottlenecks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑