@kimiahmdh: Can we tell whether data domains cooperate or compete during pretraining? Adding code to the mix makes models better at…
Summary
This research explores how different data domains interact during pretraining, finding that adding code improves math performance while some combinations hurt each other, and proposes incorporating data synergy into scaling laws.
View Cached Full Text
Cached at: 07/16/26, 06:21 PM
Can we tell whether data domains cooperate or compete during pretraining?
Adding code to the mix makes models better at math, while some other combinations hurt each other. We call this data synergy. Turns out you can incorporate data synergy into scaling laws and estimate it
Here’s a motivating example: Fit scaling laws on validation loss of a coding benchmark, across models trained on different data mixtures.
a) With the same data scaling exponent for all mixtures: bad fit! b) Let the data exponent depend on the mixture: near perfect fit!
We propose domain-aware scaling laws that account for two types of synergy:
First-order synergy: every (domain, benchmark) pair gets a coefficient that modifies the data scaling exponent.
Second-order: additional bonus tokens that appear when two domains co-occur
No training sweep required. We estimate the synergies observationally, from open-data models that already exist, and fit the scaling laws.
What do we find? Math data is a massive accelerant for coding benchmarks, meanwhile books and encyclopedias interfere with code benchmarks.
The strongest pairwise synergies, shared across benchmarks are:
Code × Science, Code × Math Math × Books: negative (they interfere with each other)
Takeaway: if your target benchmark benefits one domain, don’t spend tokens on its interfering partners.
Our domain-aware laws predict the performance of held-out models more accurately across all benchmarks.
Once you can predict performance from a mixture, you can optimize it: we use the laws to design data mixtures that perform well on a given task.
Joint work with my amazing collaborators @LesterMackey and @elmelis
Paper: https://arxiv.org/abs/2607.11052 Website: http://data-syn.github.io
To appear at #COLM2026!
Similar Articles
How Modalities Learn Together (49 minute read)
A systematic study from Meta FAIR, Reality Labs, and Oxford on multimodal pretraining, revealing asymmetric knowledge flow between modalities, synergy vs. competition dynamics, the benefits of early unification, and efficient training recipes validated with 13.5B MoE models.
Towards Physics of Multimodal Pretraining: Knowledge Flow, Modality Synergy, Early Unification, and Recipes
This paper systematically explores the physics of multimodal pretraining, uncovering how knowledge flows between modalities, conditions for synergy vs. competition, the benefits of early unification, and efficient pretraining recipes validated on 13.5B MoE models.
Scaling Laws for Mixture Pretraining Under Data Constraints
This paper studies the trade-off between scarce target data and abundant generic data in mixture pretraining, finding that repetition is a key driver of performance and that mixture training tolerates 15-20 repetitions of target data. It introduces a repetition-aware scaling law to optimize mixture configurations under data constraints.
Data Mixing for Large Language Models Pretraining: A Survey and Outlook
This paper presents a comprehensive survey of data mixing methods for LLM pretraining, formalizing the problem as bilevel optimization and introducing a taxonomy that distinguishes static (rule-based and learning-based) from dynamic (adaptive and externally guided) mixing approaches. The authors analyze trade-offs, identify cross-cutting challenges, and outline future research directions including finer-grained domain partitioning and pipeline-aware designs.
Data-Constrained Language Model Pretraining: Improved Regularization and Scaling Laws
This paper studies data-constrained language model pretraining, proposing masked-input regularization (MIR) to improve validation loss and downstream performance, and SoftQ, a scaling law that better captures model-data interaction under repeated data.