arXiv:2603.22339cs.LGcs.CL2026-03

Chinchilla方法2有系统性偏差,可能浪费数百万美元算力

Problems with Chinchilla Approach 2: Systematic Biases in IsoFLOP Parabola Fits

  • 用修正的拟合方法消除计算最优分配的偏差
  • 在真实数据上发现6.5%参数欠配,相当于140万美元冗余算力
  • 新方法稳定易用,适合追求高精度模型训练的研究者

Chinchilla Approach 2 是广泛用于拟合神经网络缩放定律的方法,其抛物线近似会引入系统性偏差,即使在无噪声合成数据上亦然。将其应用于公开的 Llama 3 IsoFLOP 数据,在开放前沿算力规模下,这些偏差意味着参数欠配达 6.5%(对应 $3.8\times10^{25}$ FLOP 训练预算),在 50% H100 MFU 条件下造成约 140 万美元(90% 置信区间:41.2 万至 290 万美元)的不必要算力消耗。模拟多模态模型的错配显示更高机会成本,源于损失曲面不对称性。本文分析了三类误差来源:IsoFLOP 采样网格宽度(泰勒展开精度)、非中心化采样、以及损失曲面不对称性(α≠β)。改进版 Chinchilla Approach 3 可基本消除这些偏差,但常被认为数据效率低、数值不稳定、易陷局部极小、难实现。本文证明这些担忧均不成立,尤其在利用目标函数部分线性结构通过 Variable Projection 优化时,可通过二维优化实现对五个损失曲面参数的无偏估计,该方法条件良好、解析可微,支持密集甚至穷尽网格搜索。该方法或可作为 Approach 2 的更优替代,或为 Approach 3 的扩展提供更可扩展方案。

原文摘要 · Abstract (English)

Chinchilla Approach 2 is among the most widely used methods for fitting neural scaling laws. Its parabolic approximation introduces systematic biases in compute-optimal allocation estimates, even on noise-free synthetic data. Applied to published Llama 3 IsoFLOP data at open frontier compute scales, these biases imply a parameter underallocation corresponding to 6.5% of the $3.8\times10^{25}$ FLOP training budget and \$1.4M (90% CI: \$412K-\$2.9M) in unnecessary compute at 50% H100 MFU. Simulated multimodal model misallocations show even greater opportunity costs due to higher loss surface asymmetry. Three sources of this error are examined: IsoFLOP sampling grid width (Taylor approximation accuracy), uncentered IsoFLOP sampling, and loss surface asymmetry ($α\neq β$). Chinchilla Approach 3 largely eliminates these biases but is often regarded as less data-efficient, numerically unstable, prone to local minima, and harder to implement. Each concern is shown to be unfounded or addressable, especially when the partially linear structure of the objective is exploited via Variable Projection, enabling unbiased inference on all five loss surface parameters through a two-dimensional optimization that is well-conditioned, analytically differentiable, and amenable to dense, or even exhaustive, grid search. It may serve as a more convenient replacement for Approach 2 or a more scalable alternative for adaptations of Approach 3 to richer scaling law formulations. See https://github.com/Open-Athena/vpnls for details and https://openathena.ai/scaling-law-analysis for other results from this study.

缩放定律算力优化模型训练

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。