# Beyond Data Schedule: Fast LLM Pretraining on Data Mixtures by Loss-Reweighting

> Separating domain exposure from loss reweighting lets pretraining expand the capability frontier, with Lare's adaptive inverse-square-root weights boosting all benchmarks by up to +17 points.

- **Source:** [arXiv](https://arxiv.org/abs/2610.32141)
- **Published:** 2026-11-14
- **Permalink:** https://picx.dev/p/mi74W1
- **Whiteboard:** https://picx.dev/p/mi74W1/image

## Summary

# Summary of "Beyond Data Schedule: Fast LLM Pretraining on Data Mixtures by Loss-Reweighting"

## Summary (Overview)

- **Core contribution**: The paper disentangles two conflated controls in multi-domain pretraining—**domain exposure** (how much data a model sees) and **optimization scale** (how strongly each domain's loss shapes parameter updates)—and demonstrates that adjusting loss weights at fixed data exposure can improve joint capabilities across knowledge, mathematics, and code.

- **Key finding**: Under matched 30B-token exposure, a fixed loss reweighting (K:M = 1:2) simultaneously surpasses the best MMLU and GSM8K scores attained along either multi-stage trajectory, showing that data-mixture ratios alone do not determine the attainable capability trade-off frontier.

- **Novel method**: The authors introduce **Lare** (Loss-Adaptive Reweighting under fixed Exposure), an online controller that derives domain weights from running loss statistics using a normalized inverse-square-root rule, eliminating the need for expensive weight sweeps.

- **Empirical results**: At 8× Chinchilla (240B tokens) with a 1.5B model, Lare improves all five evaluated benchmarks over matched direct mixing, averaging **+7.84 percentage points**, including **+17.06 pp on GSM8K** and **+9.00 pp on MATH**.

- **Theoretical grounding**: A formal analysis (Proposition 1) proves that remixing cannot dominate reweighting in a two-domain linear regression model, and Theorem 1 establishes a loss–gradient-noise scaling relationship that motivates the inverse-square-root weight rule.

---

## Introduction and Theoretical Foundation

### Background and Motivation

Large language models are increasingly expected to master multiple capabilities simultaneously (world knowledge, mathematical reasoning, code generation). Practical training recipes use multi-stage pipelines: broad-coverage corpora first, followed by domain-specialized stages. However, this creates an **acquisition–retention trade-off**—emphasizing a new domain often causes catastrophic forgetting of earlier knowledge.

The alternative—joint training on a stationary mixture—avoids distribution shifts but settles at an interior compromise, as different mixture ratios favor different domains.

### Central Insight: The Conflation Problem

The paper's key theoretical contribution is identifying that **a single control variable (mixture ratio) serves two fundamentally different roles**:

1. **Exposure**: How much data from each domain the model observes
2. **Optimization scale**: How strongly prediction errors in each domain shape parameter updates

These two quantities are conceptually distinct, and their preferred allocations need not coincide. The amount of data needed for sufficient coverage may differ from the relative loss weight that yields the strongest joint model.

### Theoretical Framework

The paper formalizes the distinction between remixing and reweighting through the SGD update equations. At a common parameter $\theta_t$, with sampling proportion $m_i$ for domain $i$ in a batch of size $B$, and mean unweighted gradient $\hat{g}_{i,t}^{(n)}$ from $n$ samples:

$$
\begin{array}{c} {\Delta \theta_{t,\mathrm{remix}} = - \bar{\eta} \sum_{i} m_{i}^{\prime} \hat{g}_{i,t}^{(B m_{i}^{\prime})},} \\ {\Delta \theta_{t,\mathrm{reweight}} = - \bar{\eta} \sum_{i} m_{i} w_{i} \hat{g}_{i,t}^{(B m_{i})} = - \sum_{i} m_{i} \eta_{i} \hat{g}_{i,t}^{(B m_{i})}, \qquad \eta_{i} = \bar{\eta} w_{i}.} \end{array}\tag{1}
$$

**Key distinction**: Remixing changes both $m_i$ and the number of samples used to estimate the gradient; reweighting keeps sample allocation fixed and scales the gradient estimate by $w_i$.

---

## Methodology

### Theoretical Analysis: Proposition 1

The paper proves that **remixing cannot dominate reweighting** in a two-domain linear regression model. The setup:

- Domains $j \in \{1, 2\}$ with symmetric positive semidefinite matrices $A_1, A_2 \in \mathbb{R}^{d \times d}$ with orthogonal supports ($A_1 A_2 = 0$)
- Samples follow $x_j \sim \mathcal{N}(0, A_j)$ and $y_j = x_j^\top w^\star$
- Population loss in domain $j$: $f_j(w) = \frac{1}{2}(w - w^\star)^\top A_j (w - w^\star)$

**Proposition 1**: Fix any feasible mixture $(p_1, p_2)$. Let $\eta_1^\star \in \arg\min_{\eta_1} L_1(p_1, \eta_1)$ and $\eta_2^\star \in \arg\min_{\eta_2} L_2(p_2, \eta_2)$. Then the optimal domain losses achieved by reweighting $(L_1(p_1, \eta_1^\star), L_2(p_2, \eta_2^\star))$ cannot be Pareto-dominated by remixing. For every feasible mixture $(p_1', p_2') \neq (p_1, p_2)$ and every shared step size $\eta'$:

$$
L_1(p_1^{\prime}, \eta^{\prime}) > L_1(p_1, \eta_1^{\star}) \text{ or } L_2(p_2^{\prime}, \eta^{\prime}) > L_2(p_2, \eta_2^{\star}).\tag{2}
$$

### Lare: The Adaptive Reweighting Algorithm

**Theorem 1 (Loss–gradient-noise scaling)**: For binary logistic regression with Gaussian inputs and label-flipping noise $\rho$:

$$
\ell_{\rho}^{\star} = \Theta(\sqrt{\rho}), \qquad u^\top \Sigma_{\rho} u = \Theta\big((\ell_{\rho}^{\star})^{2}\big), \qquad v^\top \Sigma_{\rho} v = \Theta(\ell_{\rho}^{\star})\tag{3}
$$

for every unit vector $v \perp u$. Consequently, the root-mean-square stochastic gradient norm scales as $\Theta(\sqrt{d \ell_{\rho}^{\star}})$.

This motivates the **inverse-square-root rule**: since a loss coefficient $w_i$ scales the RMS gradient linearly:

$$
\operatorname{RMS}(w_i g_i) = \Theta\left(w_i \sqrt{d_i \ell_i^{\star}}\right), \quad w_i \propto (\ell_i^{\star})^{-1/2},\tag{4}
$$

**The Lare update rule** (after learning-rate warmup):

$$
r_{i,t} = (\hat{\ell}_{i,t} + \epsilon)^{-1/2}, \qquad w_{i,t+1} = \frac{r_{i,t}}{\sum_{j} \hat{\pi}_{j,t} r_{j,t}}.\tag{5}
$$

where $\hat{\ell}_{i,t}$ is the smoothed mean unweighted cross-entropy for domain $i$, $\hat{\pi}_{i,t}$ is the estimated loss-token share, and $\epsilon > 0$ ensures numerical stability. The normalization ensures $\sum_i \hat{\pi}_{i,t} w_{i,t+1} = 1$, changing relative domain loss scales without changing their mixture-averaged coefficient.

### ActGD Optimizer

The paper also introduces **ActGD** (Activation Gradient Descent), a base optimizer that constructs row-wise updates in a whitened activation geometry. Algorithm 1 shows the row-wise $(2,\infty)$ update: it maintains EMA states for gradients ($H_t$) and uncentered input second moments ($S_t$), computes an inverse via Newton-Schulz iteration, and normalizes each row by its RMS.

---

## Empirical Validation / Results

### Controlled 30B-Token Experiments

**Key finding**: At matched 7:1 knowledge-to-mathematics exposure (26.25B knowledge + 3.75B math tokens), fixed 1:2 reweighting achieves:
- **MMLU**: 32.27 (vs. 31.40 direct mixing, +0.87)
- **GSM8K**: 38.59 (vs. 27.67 direct mixing, +10.92)

These scores **exceed the best values attained along either stage trajectory** (31.85 MMLU and 37.91 GSM8K), demonstrating that loss reweighting expands the capability frontier.

### Optimizer Comparison (Table 1)

| Optimizer | Blocks | Embed./head | Single HP set | MMLU | GSM8K |
|---|---|---|---|---|---|
| AdamW | AdamW | AdamW | ✓ | 31.30 | 21.91 |
| Muon | Muon | AdamW | ✗ | 31.40 | 27.67 |
| **ActGD** | ActGD | ActGD | ✓ | **31.82** | **28.58** |

ActGD outperforms both baselines while using a single unified hyperparameter set.

### Scaling Results (Table 2)

| Model | Objective | Size | Tokens | Mixture | MMLU | GSM8K | MATH | HumanEval | MBPP | Avg. Δ |
|---|---|---|---|---|---|---|---|---|---|---|
| Ours | Direct | 1.5B | 120B | K:M = 7:1 | 33.97 | 37.00 | 17.20 | - | - | - |
| Ours | **LARE** | 1.5B | 120B | K:M = 7:1 | **34.36** | **50.57** | **25.60** | - | - | **+7.45** |
| Ours | Direct | 1.5B | 120B | K:M:C = 7:0.5:0.5 | 33.52 | 26.76 | 13.80 | 15.85 | 9.40 | - |
| Ours | **LARE** | 1.5B | 120B | K:M:C = 7:0.5:0.5 | **33.53** | **41.55** | **20.20** | **21.34** | **12.20** | **+5.90** |
| Ours | Direct | 1.5B | 240B | K:M:C = 7:0.5:0.5 | 34.13 | 29.72 | 15.80 | 17.68 | 9.80 | - |
| Ours | **LARE** | 1.5B | 240B | K:M:C = 7:0.5:0.5 | **34.96** | **46.78** | **24.80** | **24.39** | **15.40** | **+7.84** |
| Qwen1.5 | Base | 1.8B | 2.2T | external | 33.21 | 31.46 | 9.20 | 23.17 | 3.20 | - |

**Key observations**:
- Lare's advantage **increases with training horizon**: all five benchmarks show larger gains at 8× than at 4× Chinchilla
- The 1.5B model with Lare on 240B tokens **exceeds Qwen1.5-1.8B** (pretrained on 2.2T tokens, over 9× the token budget) by 9.22 points on average
- Reasoning gains are substantial: +17.06 pp on GSM8K and +9.00 pp on MATH at 8× Chinchilla

### Lare's Online Behavior

Lare selects a stable weight ratio averaging **2.30** (between fixed 1:2 and 1:3 references) after warmup, ending at 2.41. It moves the direct endpoint from 31.40/27.67 to 32.24/39.80 without any auxiliary coefficient sweep.

---

## Theoretical and Practical Implications

### Theoretical Implications

1. **Exposure and scale are distinct controls**: The paper provides formal proof (Proposition 1) that data mixture ratios cannot subsume loss reweighting—they operate on fundamentally different dimensions of the optimization problem.

2. **Gradient noise explains the mechanism**: Theorem 1 establishes that loss scales with the square root of the gradient-noise magnitude, providing a principled basis for the inverse-square-root weight rule rather than an arbitrary heuristic.

3. **Pareto frontier expansion**: Reweighting at fixed exposure produces a strictly broader Pareto envelope than remixing alone, meaning the attainable capability trade-off is not uniquely determined by data composition.

### Practical Implications

1. **Eliminates weight sweeps**: Lare selects competitive loss scales in a single training run, avoiding the prohibitive cost of grid-searching domain weights at pretraining scale.

2. **Preserves data efficiency**: The method improves capabilities without requiring additional domain exposure—a significant practical advantage given the expense of curated data collection.

3. **Complements existing approaches**: Lare can be combined with any base optimizer and works across different mixture ratios, domain compositions, and training budgets, making it a drop-in enhancement to existing pretraining pipelines.

4. **Unified optimizer design**: The ActGD optimizer simplifies hyperparameter tuning by applying a single update family to all parameter groups, reducing the search space compared to hybrid approaches like Muon+AdamW.

---

## Conclusion

### Main Takeaways

The paper establishes that **multi-domain pretraining has two independent controls**—domain exposure and optimization scale—that standard mixture design conflates. At fixed exposure, loss reweighting produces endpoints beyond observed stage schedules and expands the remix Pareto frontier. The proposed Lare controller converts running domain losses into normalized inverse-square-root weights, preserving the sampled mixture while adapting relative optimization scale online.

### Key Results Summary

- Lare improves **all five evaluated benchmarks** for a 1.5B model trained on 240B tokens
- Average gain of **+7.84 pp** over matched direct mixing
- Gains persist and **increase with training budget** (larger at 8× than 4× Chinchilla)
- Competitive with or better than models trained on **9× more tokens**

### Future Directions

The authors suggest treating data allocation and loss scaling as separate pretraining design variables: **exposure determines what the model sees, whereas reweighting determines how strongly each domain shapes learning**. Future work could explore:

- Scaling Lare to larger model sizes and more diverse domain mixtures
- Interactions between loss reweighting and curriculum/stage scheduling
- More sophisticated adaptive rules beyond the inverse-square-root heuristic
- Theoretical analysis of reweighting dynamics in non-convex settings

---

_Markdown view of https://picx.dev/p/mi74W1, served by PicX — AI-generated visual whiteboard summaries of research papers._