C2: Scalable Rubric-Augmented Reward Modeling from Binary Preferences

arXiv cs.CL / 4/16/2026

📰 NewsSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper addresses a scalability bottleneck in rubric-augmented reward modeling, where existing approaches rely on costly human rubric annotations for better verification.
  • It finds rubric generation can fail via non-cooperative behavior, where low-quality rubrics actively mislead reward models rather than improve judgments.
  • The proposed “Cooperative yet Critical” (C2) framework trains a rubric generator using only binary preference data, then uses contrastive “helpful vs misleading” rubric pairs to learn which rubrics to trust.
  • At inference time, a critical verifier filters rubrics so the reward model follows only those deemed helpful, improving trustworthiness without external rubric annotations.
  • Experiments report up to 6.5-point gains on RM-Bench and 6.0-point length-controlled win-rate gains on AlpacaEval 2.0, including an 8B reward model reaching performance comparable to a rubric-enhanced 4× larger model.

Abstract

Rubric-augmented verification guides reward models with explicit evaluation criteria, yielding more reliable judgments than single-model verification. However, most existing methods require costly rubric annotations, limiting scalability. Moreover, we find that rubric generation is vulnerable to a failure of cooperation; low-quality rubrics actively mislead reward models rather than help. Inspired by the principle of cooperative communication, we propose Cooperative yet Critical reward modeling (C2), a framework that significantly improves reward model judgments by having the reward model critically collaborate with a rubric generator trained solely from binary preferences. In C2, we synthesize helpful and misleading rubric pairs by measuring how each rubric shifts the reward model toward or away from the correct preference. Using these contrastive pairs, we train a cooperative rubric generator to propose helpful rubrics, and a critical verifier to assess rubric validity before making its judgment, following only rubrics it deems helpful at inference time. C2 outperforms reasoning reward models trained on the same binary preferences, with gains of up to 6.5 points on RM-Bench and 6.0 points length-controlled win rate on AlpacaEval 2.0. Without external rubric annotations, C2 enables an 8B reward model to match performance achieved with rubrics from a 4\times larger model. Overall, our work demonstrates that eliciting deliberate cooperation in rubric-augmented verification makes reward models more trustworthy in a scalable way.