Scaling Data-Constrained Language Models

: Muennighoff Niklas, Rush Alexander M., Barak Boaz, Le Scao Teven, Piktus Aleksandra, Tazi Nouamane, Pyysalo Sampo, Wolf Thomas, Raffel Colin A.

: Oh A., Neumann T., Globerson A., Saenko K., Hardt M., Levine S.

: Conference on Neural Information Processing Systems

: 2023

: Advances in Neural Information Processing Systems

: Advances in Neural Information Processing Systems 36 (NeurIPS 2023)

: Advances in Neural Information Processing Systems

: 36

: 1049-5258

: https://papers.nips.cc/paper_files/paper/2023

: https://arxiv.org/abs/2305.16264

: https://arxiv.org/abs/2305.16264v1

The current trend of scaling language models involves increasing both parameter count and training dataset size. Extrapolating this trend suggests that training dataset size may soon be limited by the amount of text data available on the internet. Motivated by this limit, we investigate scaling language models in data-constrained regimes. Specifically, we run a large set of experiments varying the extent of data repetition and compute budget, ranging up to 900 billion training tokens and 9 billion parameter models. We find that with constrained data for a fixed compute budget, training with up to 4 epochs of repeated data yields negligible changes to loss compared to having unique data. However, with more repetition, the value of adding compute eventually decays to zero. We propose and empirically validate a scaling law for compute optimality that accounts for the decreasing value of repeated tokens and excess parameters. Finally, we experiment with approaches mitigating data scarcity, including augmenting the training dataset with code data or removing commonly used filters. Models and datasets from our 400 training runs are freely available at https://github.com/huggingface/datablations.