Back to Feed
Reinforcement Learning / Reasoning

Improving Multi-Reward Language Model Training

Original: Learn What's Left, Not What's Mastered: Saturation Aware Advantage Reweighting for Multi-Reward Policy Optimization

Listen to the summary

Uses a voice available on your device

Audio options
On this page 5 sections
Related concepts 2 concepts

Key Takeaways

  • SA-MRPO avoids the common pitfall where models ignore difficult objectives because they are already performing well on simpler ones.
  • The method improves accuracy on adaptive reasoning tasks by 3.8% on average across five benchmarks.
  • Correctness in mathematical reasoning improved in 12 of 15 comparisons, including up to 5% gains on AIME24.
  • Coding tasks showed a performance boost of up to 2.3% in pass rates compared to baseline methods.
  • The approach functions as an adaptive objective allocation rule rather than a rigid constraint system.

Summary & Methodology Analysis

Traditional reinforcement learning for language models often uses a fixed weighted sum to combine multiple reward objectives. This causes the model to prioritize objectives that are already satisfied while neglecting harder ones that require further learning. SA-MRPO addresses this by calculating a batch-level saturation ratio for each objective, which represents how close the model is to the reward range limit. By weighting the relative advantages by these saturation ratios, the system shifts focus toward objectives with more remaining headroom, effectively balancing the training process across competing goals.

Implementation involves a multi-step pipeline where the system first standardizes rewards for each query group and computes the saturation-aware advantage. This value is normalized across the batch before being applied to a clipped group relative surrogate objective. This setup allows for more nuanced training, particularly in tasks where multiple performance metrics like executability and test case pass rates must be balanced. The authors validated this approach using Qwen2.5-3B-Instruct and Qwen2.5-7B-Instruct models, training on the Eurus-2-RL dataset and evaluating on benchmarks such as AIME24 and AMC23.

While effective, SA-MRPO has notable constraints. It does not provide a formal certificate of improvement, as the saturation estimate is based on nominal ranges rather than the specific capacity of the current policy class. Furthermore, it does not guarantee that already saturated objectives will maintain their performance levels if new, conflicting gradients are introduced during training. Consequently, it should be viewed as an adaptive allocation rule rather than a strict multi-objective optimization framework that enforces monotonic retention of prior performance.

Interactive System Flowchart

Click diagram to expand and zoom

Illustrative Implementation

A short sketch of the paper's core idea, not the authors' own code.

# Illustrative sketch (not from the paper)
import torch

def sat_mrpo_step(logits, rewards, reward_ranges, gamma=0.5, eps=1e-8):
    # logits: model output for a batch, shape [B, vocab]
    # rewards: dict of reward tensors, each shape [B]
    # reward_ranges: dict of (min, max) tuples for each reward
    # 1. Standardize each reward independently per query group (here batch)
    std_rewards = {}
    for name, r in rewards.items():
        r_min, r_max = reward_ranges[name]
        std = (r - r_min) / (r_max - r_min + eps)
        std_rewards[name] = std
    # 2. Compute batch-level saturation ratio s^{(k)} = mean(std_reward)
    sat_ratio = {name: torch.mean(r) for name, r in std_rewards.items()}
    # 3. Compute saturation‑aware advantage
    # Assume base_adv is the usual PPO advantage (placeholder here)
    base_adv = torch.randn_like(next(iter(std_rewards.values())))  # placeholder
    weighted_adv = 0.0
    for name, adv in std_rewards.items():
        weighted_adv += (adv ** gamma) * base_adv
    # 4. Normalize across batch
    adv_norm = (weighted_adv - weighted_adv.mean()) / (weighted_adv.std(unbiased=False) + eps)
    # 5. PPO clipped surrogate (simplified)
    old_logp = torch.log_softmax(logits.detach(), dim=-1)
    new_logp = torch.log_softmax(logits, dim=-1)
    ratio = torch.exp(new_logp - old_logp).gather(1, torch.argmax(logits, dim=1, keepdim=True))
    clip_eps = 0.2
    surrogate = torch.min(ratio * adv_norm, torch.clamp(ratio, 1-clip_eps, 1+clip_eps) * adv_norm)
    loss = -surrogate.mean()
    loss.backward()
    return loss.item()

Cross-Examination & FAQs

A deeper dive clarifying mechanics, constraints, and baseline evaluations.

Q1. What is the primary problem with current multi-reward training?

Existing methods use fixed weighted sums for rewards, causing the model to over-prioritize objectives it has already solved while ignoring tasks that need more improvement.

Q2. How does this new method solve that problem?

It uses a saturation-aware approach that measures how much room for improvement remains for each goal and adjusts the reward weight accordingly.

Q3. Does this method guarantee perfect performance on all objectives?

No. The paper notes that it cannot guarantee monotonic retention of every objective if gradients conflict.

Q4. Which specific model families were used for testing?

The researchers used Qwen2.5-3B-Instruct and Qwen2.5-7B-Instruct models.

Q5. What benchmarks were used for evaluating mathematical reasoning?

The team evaluated on AIME24, AMC23, MATH500, Minerva Math, and OlympiadBench.

Q6. How does the method handle rewards in coding tasks?

It uses two rule-based reward objectives: test case pass rate and executability.

Q7. What is the limitation of the saturation estimate?

The saturation estimate is based on nominal reward ranges and does not account for the specific capacity of the policy class.

Q8. How does the improvement on AMC23 compare to the average accuracy gain?

The average accuracy gain was 3.8% across five benchmarks, with specific gains of up to 9.2% on AMC23.

Q9. Is SA-MRPO a constrained multi-objective optimization method?

No, the paper explicitly states it should be interpreted as an adaptive objective allocation rule rather than a constrained method.

Flag an issue

What is wrong with this summary?

What is wrong?