When do data mixtures improve scaling laws? Insights from high-dimensional regression
cs.LG, stat.ML
Submitted: 2026-09-29
Updated: 2026-09-29
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: Modern machine learning systems are trained on mixtures of data from different domains, and choosing the right mixture can substantially improve downstream performance.
Terminology
Abstract
Modern machine learning systems are trained on mixtures of data from different domains, and choosing the right mixture can substantially improve downstream performance. Despite an extensive literature on data mixing and reweighting, existing work is largely empirical and it remains unclear when auxiliary data genuinely improves scaling laws rather than merely providing more samples. To gain insight into this question, we study a high-dimensional mixed-data regression model with a shared regression function, heterogeneous covariances and noise levels, and dataset sizes that may grow at different rates. We establish the minimax risk under an ellipsoidal parameter constraint for the general covariance structure and derive deterministic equivalents for the test error of ridge regression under commutative covariances. We then specialize to a target domain and an auxiliary domain with aligned power-law covariance spectra, where the theory yields explicit scaling laws in terms of spectral decay, target regularity, and the relative growth of the two datasets. These laws identify regimes in which combining data mixtures provably yields a faster scaling rate than using either dataset alone. In particular, improving the scaling law requires a specific interplay between spectra and relative sample sizes of the domains. Our numerical experiments on language models exhibit the same qualitative phenomenon: appropriate data mixtures yield a faster decrease in target-domain test loss than training on either domain alone.
Sources
- The Llama 3 Herd of Models
- BiMix: A Bivariate Data Mixing Law for Language Model Pretraining
- Training Compute-Optimal Large Language Models
- A Solvable Model of Neural Scaling Laws
- A non-asymptotic theory of Kernel Ridge Regression: deterministic equivalents, test error, and GCV estimator
- Generalization error of min-norm interpolators in transfer learning
- Scaling Laws for Mixture Pretraining Under Data Constraints
- A Minimax Theory of Nonparametric Regression Under Covariate Shift
- On a synergistic learning phenomenon in nonparametric domain adaptation
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks