Optimizing Pretraining Data Mixtures with LLM-Estimated Utility

William Held, Bhargavi Paranjape, Punit Singh Koura, Mike Lewis, Frank Zhang +1 more
1/20/2025
cs.CLcs.AI

No confident code implementation found for this paper.

Abstract

Large Language Models improve with increasing amounts of high-quality training data. However, leveraging larger datasets requires balancing quality, quantity, and diversity across sources. After evaluating nine baseline methods under both compute- and data-constrained scenarios, we find token-count heuristics outperform manual and learned mixes, indicating that simple approaches accounting for dataset size and diversity are surprisingly effective. Building on this insight, we propose two complementary approaches: UtiliMax, which extends token-based heuristics by incorporating utility estimates from reduced-scale ablations, achieving up to a 10.6x speedup over manual baselines; and Model Estimated Data Utility (MEDU), which leverages LLMs to estimate data utility from small samples, matching ablation-based performance while reducing computational requirements by $\sim$200x. Together, these approaches establish a new framework for automated, compute-efficient data mixing that is robust across training regimes.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{held2025optimizing,
  title  = {Optimizing Pretraining Data Mixtures with LLM-Estimated Utility},
  author = {William Held and Bhargavi Paranjape and Punit Singh Koura and Mike Lewis and Frank Zhang and Todor Mihaylov},
  year   = {2025},
  eprint = {2501.11747},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.11747v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.11747.svg)](https://codeofpaper.com/paper/2501.11747)

Discussion