Irreducible Curriculum for Language Model Pretraining

LLM PTSAD ML LFDDR
自动数据选择和课程设计是训练大型语言模型的挑战,只有少数现有方法能够比标准训练取得改进。此外,当前的方案侧重于领域级别的选择,忽视了每个单独训练点的更细粒度的贡献。在大型语言模型上应用传统的数据点选择方法很困难:大多数在线批处理选择方法执行两次前向或后向传递,这会带来相当大的额外成本。为了缓解这些障碍,我们提出了“不可约课程”作为语言模型预训练的课程学习算法,该算法优先考虑具有更高可学性的样本。具体而言,为了避免过高的额外计算开销,我们使用小规模代理模型模拟样本损失沿主模型的训练轨迹。我们在RedPajama-1B数据集上的实验表明,与随机均匀基线和反课程策略相比,在所有7个领域中,验证困惑度均有持续改善。我们的方法还减少了网络的尖锐度,并展示了更好的MMLU基准的5-shot准确性。
Automatic data selection and curriculum design for training large language models is challenging, with only a few existing methods showing improvements over standard training. Furthermore, current schemes focus on domain-level selection, overlooking the more fine-grained contributions of each individual training point. It is difficult to apply traditional datapoint selection methods on large language models: most online batch selection methods perform two-times forward or backward passes, which introduces considerable extra costs with large-scale models. To mitigate these obstacles, we propose irreducible curriculum as a curriculum learning algorithm for language model pretraining, which prioritizes samples with higher learnability. Specifically, to avoid prohibitive extra computation overhead, we simulate the sample loss along the main model's training trajectory using a small-scale proxy model. Our experiments on the RedPajama-1B dataset demonstrate a consistent improvement on validation perplexity across all 7 domains compared to random uniform baseline and the anti-curriculum strategy. Our method also reduces the sharpness of the network and illustrates a better 5-shot accuracy on MMLU benchmarks.
许愿