小模型训练不能固定参数,否则数据评估结果会翻转。
Can Small Training Runs Reliably Guide Data Curation? Rethinking Proxy-Model Practice
- 用可调超参的小模型评估数据,而非固定配置
- 降低学习率能可靠预测大模型性能排序
- 适合大模型数据筛选与预训练配方设计
前沿AI公司常通过训练小型代理模型来决定大规模预训练的数据配方。然而,当前对小规模实验结论能否可靠迁移至全规模训练仍缺乏理解。本文揭示标准评估协议中一个关键问题:为保证‘公平’比较,所有数据配方均使用相同的小模型训练配置,这导致实验结论随超参数微调而翻转,因最优配置本质上依赖数据。该固定配置也偏离了真实大模型开发流程中必经的超参数优化步骤。因此,我们主张数据配方评估的目标应是找出在数据特定调优下表现最佳的配方。为降低调优成本,提出仅降低代理模型学习率的简单改进:实证表明该方法与完全调优的大规模语言模型预训练性能排序高度相关。理论上,对随机特征模型,该方法保持数据集按最优损失排序的一致性。在涵盖四个关键数据筛选维度的23个数据配方上验证,显著提升了小规模实验的可靠性。
原文摘要 · Abstract (English)
Data teams at frontier AI companies routinely train small proxy models to make critical decisions about pretraining data recipes for full-scale training runs. However, the community has a limited understanding of whether and when conclusions drawn from small-scale experiments reliably transfer to full-scale model training. In this work, we uncover a subtle yet critical issue in the standard experimental protocol for data recipe assessment: the use of identical small-scale model training configurations across all data recipes in the name of "fair" comparison. We show that the experiment conclusions about data quality can flip with even minor adjustments to training hyperparameters, as the optimal training configuration is inherently data-dependent. Moreover, this fixed-configuration protocol diverges from full-scale model development pipelines, where hyperparameter optimization is a standard step. Consequently, we posit that the objective of data recipe assessment should be to identify the recipe that yields the best performance under data-specific tuning. To mitigate the high cost of hyperparameter tuning, we introduce a simple patch to the evaluation protocol: using reduced learning rates for proxy model training. We show that this approach yields relative performance that strongly correlates with that of fully tuned large-scale LLM pretraining runs. Theoretically, we prove that for random-feature models, this approach preserves the ordering of datasets according to their optimal achievable loss. Empirically, we validate this approach across 23 data recipes covering four critical dimensions of data curation, demonstrating dramatic improvements in the reliability of small-scale experiments.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。