Generating Pretraining Tokens from Organic Data for Data-Bound Scaling
Not on the map. Why?
Abstract (arXiv)
LLM pretraining is shifting from a compute-bound to a data-bound regime, where available human (organic) text falls far short of scaling demands. However, reaching the data-bound regime does not mean the model has fully utilized its organic corpus. In this paper, we introduce SynPro, a synthetic data generation framework that helps LLMs more thoroughly learn from limited organic data. SynPro applies two operations, rephrasing and reformatting, that present the same organic source in diverse forms to facilitate deeper learning without introducing external information. Both generators are optimized via reinforcement learning with quality, faithfulness, and data influence rewards, and are continuously updated as pretraining plateaus to target content the model has yet to absorb. We pretrain 400M, 1.1B, and 2B models with 10% of their Chinchilla-optimal tokens (0.8B, 2.2B, and 4B) from DCLM-Baseline, reflecting a realistic data-bound regime in frontier pretraining. Our results reveal that organic data is significantly underutilized by standard repetition: SynPro unlocks 3.4--5.2x the effective tokens of repetition, even surpassing the non-data-bound oracle that trains on equivalent unique data at the 1.1B and 2B scales. Analyses confirm that faithful, model-aware synthesis sustains data-bound scaling without causing distribution collapse. We open-source our code at https://github.com/cxcscmu/SynPro.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 52 of its 64 references that are in the map. First posted on arXiv 18 May 2026.
Builds on
52 of 64 references.
References · 52
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2025Qwen3 Technical Reportcited by 8,195
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
38 more
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,175
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2017Crowdsourcing Multiple Choice Science Questionscited by 742
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 694
- 2024Phi-4 Technical Reportcited by 675
- 2023Textbooks Are All You Need II: phi-1.5 technical reportcited by 559
- 2023Scaling Data-Constrained Language Modelscited by 391
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 381
- 20242 OLMo 2 Furiouscited by 302
- 2024OLMoE: Open Mixture-of-Experts Language Modelscited by 291
- 2022Will we run out of data? Limits of LLM scaling based on human-generated datacited by 187
- 2024Rephrasing the Web: A Recipe for Compute and Data-Efficient Language Modelingcited by 156
- 2024Nemotron-CC: Transforming Common Crawl into a Refined Long-Horizon Pretraining Datasetcited by 153
- 2024A Tale of Tails: Model Collapse as a Change of Scaling Lawscited by 127
- 2024DsDm: Model-Aware Dataset Selection with Datamodelscited by 103
- 2024MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Modelscited by 96
- 2025Findings of the BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corporacited by 86
- 2024Strong Model Collapsecited by 62
- 2025Nemotron-CLIMB: CLustering-based Iterative Data Mixture Bootstrapping for Language Model Pre-trainingcited by 62
- 2024On the Diversity of Synthetic Data and its Impact on Training Large Language Modelscited by 56
- 2024Programming Every Example: Lifting Pre-training Data Quality Like Experts at Scalecited by 37
- 2024Surveying the Effects of Quality, Diversity, and Complexity in Synthetic Data From Large Language Modelscited by 31
- 2025Recycling the Web: A Method to Enhance Pre-training Data Quality and Quantity for Language Modelscited by 31
- 2025Beyond Random Sampling: Efficient Language Model Pretraining via Curriculum Learningcited by 25
- 2025BeyondWeb: Lessons from Scaling Synthetic Data for Trillion-scale Pretrainingcited by 19
- 2026jina-embeddings-v5-text: Task-Targeted Embedding Distillationcited by 19
- 2024The Mirrored Influence Hypothesis: Efficient Data Influence Estimation by Harnessing Forward Passescited by 16
- 2025DataMan: Data Manager for Pre-training Large Language Modelscited by 16
- 2025RefineX: Learning to Refine Pre-training Data at Scale from Expert-Guided Programscited by 15
- 2024Montessori-Instruct: Generate Influential Training Data Tailored for Student Learningcited by 12
- 2025Group-Level Data Selection for Efficient Pretrainingcited by 12
- 2025Reformulation for Pretraining Data Augmentationcited by 9
- 2025Will LLMs Scaling Hit the Wall? Breaking Barriers via Distributed Resources on Massive Edge Devicescited by 9
- 2025RePro: Training Language Models to Faithfully Recycle the Web for Pretrainingcited by 6
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.