Pith. sign in

REVIEW 2 cited by

D4: Improving LLM Pretraining via Document De-Duplication and Diversification

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.12284 v1 pith:7MH45DVJ submitted 2023-08-23 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords datatrainingselectionbaselinebeende-duplicationdownstreamimprovements
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Over recent years, an increasing amount of compute and data has been poured into training large language models (LLMs), usually by doing one-pass learning on as many tokens as possible randomly selected from large-scale web corpora. While training on ever-larger portions of the internet leads to consistent performance improvements, the size of these improvements diminishes with scale, and there has been little work exploring the effect of data selection on pre-training and downstream performance beyond simple de-duplication methods such as MinHash. Here, we show that careful data selection (on top of de-duplicated data) via pre-trained model embeddings can speed up training (20% efficiency gains) and improves average downstream accuracy on 16 NLP tasks (up to 2%) at the 6.7B model scale. Furthermore, we show that repeating data intelligently consistently outperforms baseline training (while repeating random data performs worse than baseline training). Our results indicate that clever data selection can significantly improve LLM pre-training, calls into question the common practice of training for a single epoch on as much data as possible, and demonstrates a path to keep improving our models past the limits of randomly sampling web data.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sketching the Readout of Large Language Models for Scalable Data Attribution and Valuation

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    RISE applies CountSketch to dual lexical and semantic channels derived from output-layer gradient outer products, cutting data attribution storage by up to 112x and enabling retrospective and prospective influence ana...

  2. FisherSFT: Data-Efficient Supervised Fine-Tuning of Language Models Using Information Gain

    cs.LG 2025-05 conditional novelty 5.0 of 10

    A greedy token-level Fisher information data selection method that reports improved sample efficiency for GPT-2 supervised fine-tuning on Shakespeare text relative to uniform, density, and AskLLM baselines.

Pith tools