GREATS: Online Selection of High-Quality Data for LLM Training in Every Iteration

Jiachen T. Wang, Tong Wu, D. Song, Prateek Mittal, Ruoxi Jia
2/3/2026

Abstract

Online batch selection methods offer an adaptive alternative to static training data selection by dynamically selecting data batches during training. However, existing methods either rely on impractical reference models or simple heuristics that may not capture true data informativeness. To address these limitations, we propose GREedy Approximation Taylor Selection (GREATS), a principled and efficient online batch selection method that applies greedy algorithm to optimize the data batch quality approximated by Taylor expansion. We develop a series of techniques to scale GREATS to large-scale model training. Extensive experiments with large language models (LLMs) demonstrate that GREATS significantly improves training convergence speed and generalization performance. Our codebase is publically available at https://github.com/Jiachen-T-Wang/GREATS .

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

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

Cite this paper

@article{wang2026greats,
  title  = {GREATS: Online Selection of High-Quality Data for LLM Training in Every Iteration},
  author = {Jiachen T. Wang and Tong Wu and D. Song and Prateek Mittal and Ruoxi Jia},
  year   = {2026},
  doi    = {10.52202/079017-4169},
  url    = {https://doi.org/10.52202/079017-4169},
  journal = {NEURIPS 2024 2024}
}

Discussion