Improving Pretraining Data Using Perplexity Correlations

LLM PTSAD ML SSLRO
2024年09月09日
优质的预训练数据通常被视为高性能语言模型的关键。然而,由于需要进行数据选择实验的昂贵预训练运行,因此了解预训练数据的进展缓慢。我们提出了一个框架,可以避免这些成本,并选择高质量的预训练数据,而不需要进行任何我们自己的LLM(语言模型)训练。我们的工作基于一个简单的观察:许多预训练文本上的LLM损失与下游基准性能相关,选择高相关文档是一种有效的预训练数据选择方法。我们建立了一个新的统计框架,以困惑度-基准相关性的估计为中心,并使用来自Open LLM排行榜上数以万计的Web域的文本的90个LLM样本进行数据选择。在8个基准测试的160M参数规模的受控预训练实验中,我们的方法在每个基准测试中都优于DSIR,同时与DataComp-LM中找到的最佳数据选择器相匹配,这是一个手工制作的二元分类器。
Quality pretraining data is often seen as the key to high-performance language models. However, progress in understanding pretraining data has been slow due to the costly pretraining runs required for data selection experiments. We present a framework that avoids these costs and selects high-quality pretraining data without any LLM training of our own. Our work is based on a simple observation: LLM losses on many pretraining texts are correlated with downstream benchmark performance, and selecting high-correlation documents is an effective pretraining data selection method. We build a new statistical framework for data selection centered around estimates of perplexity-benchmark correlations and perform data selection using a sample of 90 LLMs taken from the Open LLM Leaderboard on texts from tens of thousands of web domains. In controlled pretraining experiments at the 160M parameter scale on 8 benchmarks, our approach outperforms DSIR on every benchmark, while matching the best data selector found in DataComp-LM, a hand-engineered bigram classifier.
许愿