arXiv paper· machine learning / NLP (LLM post-training and alignment)· method paper with empirical study

Uncovering and Mitigating Aggregation-Induced Reward Hacking in Multi-Reward Reinforcement Learning

Yu Yuan, Yaoyou Fan, Lili Zhao, Guangting Zheng, Kai Zhang, Lu Pan, Ke Zeng, Qi Liu

cs.CL

Quick verdict

AMRP adapts multi-reward weights online to curb aggregation-induced shortcut lock-in; gains look real but single-seed runs and circular evals limit confidence.

Summary

The paper identifies a failure mode in multi-reward RL fine-tuning of LLMs: when several individually valid reward dimensions (accuracy, format, length, citation quality, reward-model attributes) are scalarized with fixed weights, the projection aliases distinct reward profiles and steers optimization toward whichever dimensions are easiest or densest. The authors demonstrate this 'reward-profile collapse' in mathematical reasoning: between steps 35 and 40, scalar reward climbs from 1.445 to 1.973 while accuracy falls from 0.258 to 0.090 as shortcut rollouts (format and length satisfied, answer wrong) dominate. They propose Adaptive Multi-Reward Projection (AMRP), which reallocates aggregation weights online from three EMA-smoothed signals — relative shortfall, volatility, and recent progress — combined multiplicatively. Under GRPO, AMRP lifts Qwen3-4B average accuracy on MATH-500/AMC/AIME from 37.53 (static weighting) to 60.72 and improves citation-grounded QA (Llama-3.1-8B overall 59.21→75.56 on ASQA/ELI5); on open-ended alignment gains are small but consistent, and the method also composes with GDPO and PPO. Key limitations: every main table reports single-run, fixed-seed results with no variance or significance testing; AIME has only 30 unique problems; the alignment evaluation reuses ArmoRM as both training reward and judge; and AMRP's format/length scores drop markedly (Table 1 Overall 66.75 vs DRBOdelta 80.74 for Qwen3-4B), which the accuracy-centered narrative does not foreground.

Review complete

Assessment at a glance

machine learning / NLP (LLM post-training and alignment)

5

risk flags identified

● high 1

● medium 3

● low 1

Reproducibility readinessmedium
Code & data availableyes
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducibleNeeds GPU

5 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Static fixed-weight aggregation alone — even when every reward dimension is individually valid — can induce reward hacking via profile aliasing and shortcut lock-in.
  • In math reasoning under static weighting, scalar reward rises (1.445→1.973, steps 35–40) while accuracy falls (0.258→0.090) as shortcut profiles (0,1,1) come to dominate rollouts.
  • AMRP's three-signal online reweighting improves downstream performance over static and DRBO baselines across math reasoning, citation-grounded QA, and open-ended alignment, and composes with GRPO, GDPO, and PPO.
  • The multiplicative (soft-conjunction) combination of the three signals outperforms an additive variant and every single-signal ablation (Table 6: 60.72 vs 57.61/57.04/56.25/57.12 average accuracy).

Strengths

  • Compelling mechanistic diagnosis

    Sec. 3.3/Fig. 2 quantifies the failure precisely: between steps 35-40 scalar reward rises 1.445→1.973 while accuracy drops 0.258→0.090, format/length saturate, the (0,1,1) shortcut profile dominates rollouts, and response length collapses — aliasing and lock-in are demonstrated, not merely asserted.

  • Breadth of validation

    Three reward regimes (rule-based, automatic evaluator, learned RM) × two backbones each (Tables 1-3), plus GRPO/GDPO/PPO composition (Table 4), prior-vector comparison (Table 5), signal ablations (Table 6), and hyperparameter sweeps (Table 7).

  • Honest handling of the mild setting

  • Strong headline accuracy results

  • Plug-in simplicity with full specification

Weaknesses

  • Single-run reporting with tiny effective evaluation sets

  • Circular evaluation in two of three settings

  • Composite metric tension unacknowledged

  • Missing random-perturbation control

  • Baseline tuning parity and literature scope

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What is aggregation-induced reward hacking?

It is the failure mode the paper names when several individually valid reward dimensions are combined into one scalar with fixed weights. Because distinct reward profiles (e.g., a correct but malformed answer vs. a wrong but well-formatted one) can produce the same scalar, optimization drifts toward whichever dimensions are easiest or densest to improve, and the policy locks into shortcut behaviors that score well without solving the task.

How does AMRP work?

AMRP keeps the standard weighted-sum aggregation but updates the weights during training. Every N steps it computes three EMA-smoothed statistics per reward dimension — relative shortfall (how far the dimension lags the others), volatility (instability), and recent progress (stagnation) — multiplies them into a priority score, and normalizes the scores into mean-one weights, shifting optimization pressure toward lagging, unstable, or stagnant dimensions.

Does AMRP work with RL algorithms other than GRPO?

The paper reports yes. On Qwen3-4B math reasoning, average accuracy improved from 52.54 to 57.24 with GDPO and from 54.34 to 57.79 with PPO (versus static weighting), in addition to 37.53 to 60.72 under GRPO (Table 4).

Is the AMRP code available?

The paper links a GitHub repository (github.com/yyhappier/AMRP) and the appendix specifies datasets, reward definitions, and hyperparameters. However, results are reported from single runs with fixed random seeds, and experiments require multi-GPU training of 4B-8B models.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • All figures are images; only captions and numbers quoted in the body text are available in the extraction, so curve-level evidence (Fig. 2/3 trajectories) was assessed from captions and quoted values, not the plots themselves.
  • Wide results tables (notably Tables 1 and 4) appear linearized in the extracted text; cell values were mapped using the column order stated in each caption (per-benchmark Acc/Fmt/Len, then macro-averages, then Overall).

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
Uncovering and Mitigating Aggregation-Induced Reward Hacking in Multi-Reward Reinforcement Learning | Evolve.Pub