Using Scaling Laws for Data Source Utility Estimation in Domain-Specific Pre-Training
Not on the map. Why?
Abstract (arXiv)
We introduce a framework for optimizing domain-specific dataset construction in foundation model training. Specifically, we seek a cost-efficient way to estimate the quality of data sources (e.g. synthetically generated or filtered web data, etc.) in order to make optimal decisions about resource allocation for data sourcing from these sources for the stage two pre-training phase, aka annealing, with the goal of specializing a generalist pre-trained model to specific domains. Our approach extends the usual point estimate approaches, aka micro-annealing, to estimating scaling laws by performing multiple annealing runs of varying compute spent on data curation and training. This addresses a key limitation in prior work, where reliance on point estimates for data scaling decisions can be misleading due to the lack of rank invariance across compute scales -- a phenomenon we confirm in our experiments. By systematically analyzing performance gains relative to acquisition costs, we find that scaling curves can be estimated for different data sources. Such scaling laws can inform cost effective resource allocation across different data acquisition methods (e.g. synthetic data), data sources (e.g. user or web data) and available compute resources. We validate our approach through experiments on a pre-trained model with 7 billion parameters. We adapt it to: a domain well-represented in the pre-training data -- the medical domain, and a domain underrepresented in the pretraining corpora -- the math domain. We show that one can efficiently estimate the scaling behaviors of a data source by running multiple annealing runs, which can lead to different conclusions, had one used point estimates using the usual micro-annealing technique instead. This enables data-driven decision-making for selecting and optimizing data sources.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 44 references that are in the map. First posted on arXiv 29 Jul 2025.
Builds on
36 of 44 references.
References · 36
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2023Mistral 7Bcited by 3,164
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
- 2015A Diversity-Promoting Objective Function for Neural Conversation Modelscited by 1,077
- 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 523
- 2024Dolma: an Open Corpus of Three Trillion Tokens for Language Model Pretraining Researchcited by 483
24 more
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 399
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 398
- 20242 OLMo 2 Furiouscited by 340
- 2023Data Filtering Networkscited by 250
- 2024Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performancecited by 184
- 2024RegMix: Data Mixture as Regression for Language Model Pre-trainingcited by 177
- 2024Rephrasing the Web: A Recipe for Compute and Data-Efficient Language Modelingcited by 161
- 2024Nemotron-4 340B Technical Reportcited by 144
- 2024Zamba: A Compact 7B SSM Hybrid Modelcited by 124
- 2024Scaling Laws for Data Filtering -- Data Curation cannot be Compute Agnosticcited by 77
- 2023TinyGSM: achieving >80% on GSM8k with small language modelscited by 70
- 2024Instruction Pre-Training: Language Models are Supervised Multitask Learnerscited by 63
- 2024Smaller, Weaker, Yet Better: Training LLM Reasoners via Compute-Optimal Samplingcited by 61
- 2024Does your data spark joy? Performance gains from domain upsampling at the end of trainingcited by 52
- 2023Adapting Large Language Models to Domains via Reading Comprehensioncited by 50
- 2024Adaptive Data Optimization: Dynamic Sample Selection with Scaling Lawscited by 47
- 2022On the Domain Adaptation and Generalization of Pretrained Language Models: A Surveycited by 23
- 2024Why do small language models underperform? Studying Language Model Saturation via the Softmax Bottleneckcited by 21
- 2022Downstream Datasets Make Surprisingly Good Pretraining Corporacited by 20
- 2024ScalingFilter: Assessing Data Quality through Inverse Utilization of Scaling Lawscited by 15
- 2024MIND: Math Informed syNthetic Dialogues for Pretraining LLMscited by 14
- 2024Scaling Parameter-Constrained Language Models with Quality Datacited by 12
- 2024Data, Data Everywhere: A Guide for Pretraining Dataset Constructioncited by 11
- 2024Scalable Data Ablation Approximations for Language Models through Modular Training and Mergingcited by 11
Built on by
Not cited yet.