arXiv:2602.05400cs.CL2026-02被引 12

OPUS动态筛选高质量文本,提升大模型预训练效率与效果。

OPUS: Towards Efficient and Principled Data Selection in Large Language Model Pre-training in Every Iteration

  • 基于优化器更新空间设计数据评分机制,捕捉训练动态变化。
  • 在300亿令牌训练中超越工业级基线,0.5亿令牌达30亿令牌效果。
  • 适合追求数据效率、资源受限的模型预训练场景。

随着高质量公开文本接近枯竭(数据墙现象),大模型预训练正从追求更多文本转向更优文本。现有方法或依赖忽略训练动态的静态启发式过滤,或采用不考虑优化器的原始梯度动态标准。本文提出OPUS(优化器诱导投影效用选择):一种在优化器诱导更新空间中定义效用的动态数据选择框架。通过将有效更新投影到由稳定分布代理生成的目标方向,实现精准评分。为保证可扩展性,采用Ghost技术结合CountSketch以降低计算开销,并使用Boltzmann采样保障数据多样性,仅增加4.7%额外计算量。OPUS在多种语料库、质量层级、优化器和模型规模下表现优异:在300亿令牌的FineWeb/FineWeb-Edu上预训练GPT-2 Large/XL时,性能超越工业级基线,甚至优于完整2000亿令牌训练。结合工业级静态过滤后,即使在低质数据下仍显著提升效率。在Qwen3-8B-Base的持续预训练中,仅用0.5亿令牌即达到3亿令牌全量训练的效果,证明其在专业领域中的极强数据效率。

原文摘要 · Abstract (English)

As high-quality public text approaches exhaustion, a phenomenon known as the Data Wall, pre-training is shifting from more tokens to better tokens. However, existing methods either rely on heuristic static filters that ignore training dynamics, or use dynamic yet optimizer-agnostic criteria based on raw gradients. We propose OPUS (Optimizer-induced Projected Utility Selection), a dynamic data selection framework that defines utility in the optimizer-induced update space. OPUS scores candidates by projecting their effective updates, shaped by modern optimizers, onto a target direction derived from a stable, in-distribution proxy. To ensure scalability, we employ Ghost technique with CountSketch for computational efficiency, and Boltzmann sampling for data diversity, incurring only 4.7\% additional compute overhead. OPUS achieves remarkable results across diverse corpora, quality tiers, optimizers, and model scales. In pre-training of GPT-2 Large/XL on FineWeb and FineWeb-Edu with 30B tokens, OPUS outperforms industrial-level baselines and even full 200B-token training. Moreover, when combined with industrial-level static filters, OPUS further improves pre-training efficiency, even with lower-quality data. Furthermore, in continued pre-training of Qwen3-8B-Base on SciencePedia, OPUS achieves superior performance using only 0.5B tokens compared to full training with 3B tokens, demonstrating significant data efficiency gains in specialized domains.

数据选择大模型预训练高效训练优化器

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