Optimal Splitting of Language Models from Mixtures to Specialized Domains
Not on the map. Why?
Abstract (arXiv)
Language models achieve impressive performance on a variety of knowledge, language, and reasoning tasks due to the scale and diversity of pretraining data available. The standard training recipe is a two-stage paradigm: pretraining first on the full corpus of data followed by specialization on a subset of high quality, specialized data from the full corpus. In the multi-domain setting, this involves continued pretraining of multiple models on each specialized domain, referred to as split model training. We propose a method for pretraining multiple models independently over a general pretraining corpus, and determining the optimal compute allocation between pretraining and continued pretraining using scaling laws. Our approach accurately predicts the loss of a model of size N with D pretraining and D' specialization tokens, and extrapolates to larger model sizes and number of tokens. Applied to language model training, our approach improves performance consistently across common sense knowledge and reasoning benchmarks across different model sizes and compute budgets.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 48 of its 55 references that are in the map. First posted on arXiv 19 Mar 2026.
Builds on
48 of 55 references.
References · 48
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023GPT-4 Technical Reportcited by 18,396
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
36 more
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2024Dolma: an Open Corpus of Three Trillion Tokens for Language Model Pretraining Researchcited by 483
- 2023Scaling Data-Constrained Language Modelscited by 403
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 398
- 20242 OLMo 2 Furiouscited by 340
- 2021Scaling Laws for Transfercited by 272
- 2022Unified Scaling Laws for Routed Language Modelscited by 253
- 2022MegaBlocks: Efficient Sparse Training with Mixture-of-Expertscited by 209
- 2024When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Methodcited by 204
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 191
- 2024Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performancecited by 184
- 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 173
- 2024Rephrasing the Web: A Recipe for Compute and Data-Efficient Language Modelingcited by 161
- 2024Nemotron-CC: Transforming Common Crawl into a Refined Long-Horizon Pretraining Datasetcited by 160
- 2024Scaling Laws for Data Filtering -- Data Curation cannot be Compute Agnosticcited by 77
- 2024Learning to Route LLMs with Confidence Tokenscited by 67
- 2025Nemotron-CLIMB: CLustering-based Iterative Data Mixture Bootstrapping for Language Model Pre-trainingcited by 66
- 2023Scaling Expert Language Models with Unsupervised Domain Discoverycited by 60
- 2025MixLLM: Dynamic Routing in Mixed Large Language Modelscited by 59
- 2025Overtrained Language Models Are Harder to Fine-Tunecited by 58
- 2025Scaling Laws for Optimal Data Mixturescited by 52
- 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Modelscited by 50
- 2024D-CPT Law: Domain-specific Continual Pre-Training Scaling Law for Large Language Modelscited by 41
- 2025Scaling Laws for Forgetting during Finetuning with Pretraining Data Injectioncited by 35
- 2024Scaling Laws Across Model Architectures: A Comparative Analysis of Dense and MoE Models in Large Language Modelscited by 25
- 2024Mixture of Parrots: Experts improve memorization more than reasoningcited by 21
- 2023OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Trackingcited by 19
- 2024Task-Adaptive Pretrained Language Models via Clustered-Importance Samplingcited by 18
- 2025FlexOlmo: Open Language Models for Flexible Data Usecited by 15
- 2025Pretraining with hierarchical memories: separating long-tail and common knowledgecited by 14
- 2025Efficient Training-Free Online Routing for High-Volume Multi-LLM Servingcited by 13
- 2024Scaling Parameter-Constrained Language Models with Quality Datacited by 12
- 2025Essential-Web v1.0: 24T tokens of organized web datacited by 8
- 2024No Need to Talk: Asynchronous Mixture of Language Modelscited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Scaling Laws for Mixture Pretraining Under Data Constraints12 May 2026