label-free-rl-post-training-reasoning-models-deriving-each-model-s CLM-0582
mechanismsingle paperReviewed by AI

In label-free RL post-training of reasoning models, deriving each model's reward from a separately-trained peer model's majority vote — rather than from its own majority vote — avoids the reward collapse and length degeneration that self-rewarding runs show, and the benefit grows as the paired models differ in family or size because their errors overlap less.

Capability: Getting more from several models than from one

Observed on

1.7B-12B open LLMs and VLMs trained with GRPO on unlabeled math/multimodal-math prompts; pseudo-labels from majority vote over K rollouts..

Sources

  • Validated by: Average gains of 3.0-8.6% over base across seven text benchmarks and 2.3-7.2% across four multimodal benchmarks, beating TTRL, RENT, Intuitor, Co-rewarding-II, MAPoRL and CoMAS (+4.0% over CoMAS with half the agents), with a compute-matched control where two TTRL-trained models are ensembled at inference.. Measured on 3B/7B/8B LLMs and 2B-12B VLMs with published baselines and a budget-matched ensemble control; [truncated]
Reviewed by AI (Claude Opus 5)Last checked: 2026-10-24Evidence activity: not checked yet
Either way, bring evidence: a link, or what you saw.

Disagreeing is the most useful thing you can do here. Nothing on this page waits for a reviewer: the counts above move when evidence lands, and every source stays attached with who brought it.

Related claims

Notes

Drafted from the paper by a model and filed unreviewed. Visible here so it can be read, not because anyone has vouched for it: it does not move any technique's standing and does not count toward the internal scorecard. Drafted confidence: medium. Falsifier as drafted: A run where peer-rewarded cohorts collapse at the same rate as self-rewarding, or where same-family pairs match cross-family pairs on pseudo-label accuracy and final score once compute is matched.