RegMix-D: Dynamic Data Mixing via Proxy Training Trajectories

• URL: http://arxiv.org/abs/2606.18663v1
• Date: Wed, 17 Jun 2026 04:02:38 GMT
• Title: RegMix-D: Dynamic Data Mixing via Proxy Training Trajectories
• Abstract summary: Existing methods such as RegMix select a single static mixture by fitting a regression model on small-scale proxy runs.<n>We propose RegMix-D, a simple extension of RegMix to dynamic mixing.<n>RegMix-D consistently improves over RegMix and DoReMi across 13 downstream tasks while remaining proxy-efficient.
• Score: 26.65097170527164
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Data mixture selection is critical for Large Language Model pretraining. Existing methods such as RegMix select a single static mixture by fitting a regression model on small-scale proxy runs. We propose RegMix-D, a simple extension of RegMix to dynamic mixing. Our key observation is that proxy runs produce not only endpoint losses, but also full loss trajectories, which can be used to further improve data mixture. By training regression model on these trajectories, we can predict optimal mixtures at multiple training stages. RegMix-D supports two deployment modes: an offline variant that generates a complete mixture schedule before target training, and an online variant that adapts the mixture during training using observed loss. Experiments on 25B tokens of the Pile dataset with a 1B parameter target model show that RegMix-D consistently improves over RegMix and DoReMi across 13 downstream tasks while remaining proxy-efficient: it surpasses RegMix even with only 128 proxy models (25% of RegMix's proxy compute budget).

Related papers

• FastMix: Fast Data Mixture Optimization via Gradient Descent [55.109758242985556]
  Fastmix is a novel framework that automates data mixture discovery while training only a single proxy model.<n>We show that optimizing mixture ratios is mathematically equivalent to assigning per-source loss weights under uniform source sampling.<n>FASTmix outperforms baselines while drastically reducing search cost across pre-intensive and post-training.
  arXiv  Detail & Related papers  (2026-06-12T21:46:57Z)
• Mix, Don't Tune: Bilingual Pre-Training Outperforms Hyperparameter Search in Data-Constrained Settings [24.462817377406754]
  We show how to improve language model pre-training in a data-constrained domain.<n>We use Arabic as the low-resource target and English as the auxiliary.<n>We quantify how much mixing helps: it boosts performance by an amount equivalent to 2--3$times$ the unique target data on validation loss and 2--13$times$ on downstream task accuracy.
  arXiv  Detail & Related papers  (2026-05-13T09:17:51Z)
• Always Learning, Always Mixing: Efficient and Simple Data Mixing All The Time [51.671620992989375]
  We introduce OP-Mix, a data mixing algorithm that operates across the entire language model training lifecycle.<n>In pretraining, OP-Mix improves upon training without mixing by 6.3% in average perplexity.<n>For continual learning, OP-Mix matches the performance of both retraining and on-policy distillation while using 66% and 95% less overall compute.
  arXiv  Detail & Related papers  (2026-05-13T02:29:19Z)
• Decouple Searching from Training: Scaling Data Mixing via Model Merging for Large Language Model Pre-training [16.022416196267937]
  We propose Decouple Searching from Training Mix (DeMix), a novel framework that leverages model merging to predict optimal data ratios.<n>We show that DeMix breaks the trade-off between sufficiency, accuracy and efficiency, obtaining the optimal mixture with higher benchmark performance at lower search cost.
  arXiv  Detail & Related papers  (2026-01-31T14:27:46Z)
• MergeMix: Optimizing Mid-Training Data Mixtures via Learnable Model Merging [72.00014675808228]
  textbfMix determines optimal data mixing ratios by repurposing model merging weights as a high-fidelity, low-cost performance proxy.<n>Experiments on models with 8B and 16B parameters validate that MergeMix achieves performance comparable to or surpassing exhaustive manual tuning.
  arXiv  Detail & Related papers  (2026-01-25T14:31:57Z)
• RegMix: Data Mixture as Regression for Language Model Pre-training [40.45464495981735]
  We propose RegMix to automatically identify a high-performing data mixture by formulating it as a regression task.<n>RegMix trains many small models on diverse data mixtures, uses regression to predict performance of unseen mixtures, and applies the best predicted mixture to train a large-scale model with orders of magnitude more compute.
  arXiv  Detail & Related papers  (2024-07-01T17:31:03Z)
• Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performance [55.872926690722714]
  We study the predictability of model performance regarding the mixture proportions in function forms.<n>We propose nested use of the scaling laws of training steps, model sizes, and our data mixing law.<n>Our method effectively optimize the training mixture of a 1B model trained for 100B tokens in RedPajama.
  arXiv  Detail & Related papers  (2024-03-25T17:14:00Z)
• A Data Cartography based MixUp for Pre-trained Language Models [47.90235939359225]
  MixUp is a data augmentation strategy where additional samples are generated during training by combining random pairs of training samples and their labels. We propose TDMixUp, a novel MixUp strategy that leverages Training Dynamics and allows more informative samples to be combined for generating new data samples. We empirically validate that our method not only achieves competitive performance using a smaller subset of the training data compared with strong baselines, but also yields lower expected calibration error on the pre-trained language model, BERT, on both in-domain and out-of-domain settings in a wide range of NLP tasks.
  arXiv  Detail & Related papers  (2022-05-06T17:59:19Z)
• Harnessing Hard Mixed Samples with Decoupled Regularizer [69.98746081734441]
  Mixup is an efficient data augmentation approach that improves the generalization of neural networks by smoothing the decision boundary with mixed data. In this paper, we propose an efficient mixup objective function with a decoupled regularizer named Decoupled Mixup (DM) DM can adaptively utilize hard mixed samples to mine discriminative features without losing the original smoothness of mixup.
  arXiv  Detail & Related papers  (2022-03-21T07:12:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.