GRAPE: Optimize Data Mixture for Group Robust Multi-target Adaptive Pretraining
Not on the map. Why?
Abstract (arXiv)
The performance of large language models (LLMs) across diverse downstream applications is fundamentally governed by the quality and composition of their pretraining corpora. Existing domain reweighting algorithms primarily optimize data mixtures for a single target task, thereby resulting in models that overfit to specialized objectives while exhibiting substantial performance degradation on other benchmarks. This paper introduces Group Robust Multi-target Adaptive PrEtraining (GRAPE), a novel multi-source-multi-target domain reweighting framework designed to calibrate pretraining data mixtures for robust performance across multiple target tasks simultaneously. GRAPE dynamically adjusts sampling weights across source domains (domain weights) while concurrently modulating task weights that quantify the relative importance of each individual target task. This adaptive process prioritizes tasks based on their learning difficulty throughout training. We formulate this interleaved reweighting mechanism as a minimax optimization problem: The inner maximization adjusts task weights leveraging group distributed-robust-optimization (DRO), where those tasks demonstrating the least improvement under the current data mixture are prioritized with higher weights; The outer minimization then optimizes domain weights to maximize loss reduction on the prioritized tasks. Experiments on ClimbLab and SlimPajama datasets demonstrate that GRAPE consistently outperforms baseline methods in terms of reasoning performance across 6 benchmarks. Furthermore, when applied to multilingual targets, GRAPE effectively identifies optimal training mixtures from mainstream languages, achieving superior language modeling capabilities across 8 low-resource target languages.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 24 of its 30 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
24 of 30 references.
References · 24
- 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
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 399
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
12 more
- 2020Retrieve, Program, Repeat: Complex Knowledge Base Question Answering via Alternate Meta-learningcited by 216
- 2022Multi-Task Learning as a Bargaining Gamecited by 215
- 2024RegMix: Data Mixture as Regression for Language Model Pre-trainingcited by 177
- 2023Skill-it! A Data-Driven Skills Framework for Understanding and Training Language Modelscited by 121
- 2023DoGE: Domain Reweighting with Generalization Estimationcited by 90
- 2023Efficient Online Data Mixing For Language Model Pre-Trainingcited by 77
- 2025Nemotron-CLIMB: CLustering-based Iterative Data Mixture Bootstrapping for Language Model Pre-trainingcited by 66
- 2020Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptationcited by 53
- 2020An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectivescited by 42
- 2024Task-Adaptive Pretrained Language Models via Clustered-Importance Samplingcited by 18
- 2024Dynamic Gradient Alignment for Online Data Mixingcited by 10
- 2024Task Weighting through Gradient Projection for Multitask Learningcited by 4
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2026Multi-Task GRPO: Reliable LLM Reasoning Across Taskscited by 14
- 2026DynaMiCS: Fine-tuning LLMs with Performance Constraints using Dynamic Mixturescited by 4
- 2025ADAPT: Learning Task Mixtures for Budget-Constrained Instruction Tuningcited by 3
- 2026Always Learning, Always Mixing: Efficient and Simple Data Mixing All The Timecited by 0
- 2026Always Learning, Always Mixing: Efficient and Simple Data Mixing All The Time13 May 2026
- 2026DynaMiCS: Fine-tuning LLMs with Performance Constraints using Dynamic Mixtures11 May 2026
- 2026Multi-Task GRPO: Reliable LLM Reasoning Across Tasks5 Feb 2026
- 2025ADAPT: Learning Task Mixtures for Budget-Constrained Instruction Tuning4 Dec 2025