The scorecards AI uses to learn often break in new domains — and the flaw is baked into how they score.
What makes current learned reward models fail across different domains?
This explores why reward models — the learned scoring systems that guide RL training — break down when moved across tasks or domains, and what design choices cause those failures.
This explores why learned reward models fail across different domains — and the corpus points to a common root: most reward models score outputs in absolute, outcome-only terms, which doesn't travel. The clearest structural failure is calibration. Binary correctness rewards reward confident guessing because they never penalize a confident wrong answer, so a model trained this way becomes miscalibrated in exactly the way that generalizes badly to new domains where the model is less sure Does binary reward training hurt model calibration?. A scalar 'right/wrong' signal is also information-starved: it tells the model *that* it failed but not *why*, so training stalls on plateaus that no amount of numerical scaling breaks — the reward simply lacks the content needed to improve in an unfamiliar setting Can natural language feedback overcome numerical reward plateaus?.
A second failure mode is that reward models learn absolute preference labels that are tied to the task they were trained on. POLAR reframes this directly: instead of judging outputs against a fixed preference scale, it measures how close a policy is to a target policy, which is what lets its reward models transfer across task formulations where label-based RMs don't Can reward models learn by comparing policies instead of judging them?. The implication is that cross-domain failure isn't a data-volume problem — it's baked into the objective. When the reward is 'match these human labels,' the labels themselves are domain-bound.
The deeper worry is what RL-tuned rewards actually change in the model. Analyses of RLVR find that reward learning mostly sharpens sampling toward solutions the base model already contained rather than teaching genuinely new reasoning — spurious rewards work almost as well as correct ones, and a single example can trigger the effect What does reward learning actually do to model reasoning? Does RLVR actually expand what models can reason about?. That reframes 'cross-domain failure': a reward model can't reward capability the base model never had, so in a domain outside the base model's competence there's nothing for the reward to activate. This also explains why positive-only reinforcement can hurt — it concentrates probability mass and collapses the diversity you'd need to solve unfamiliar problems, whereas negative reinforcement preserves it Does negative reinforcement alone outperform full reinforcement learning?.
The corpus's proposed fixes all attack the thinness of the signal. Reasoning-based reward models add chain-of-thought before scoring, which raises the evaluator's ceiling and lets it scale test-time compute on hard, unfamiliar judgments instead of snapping to a shallow verdict Can reward models benefit from reasoning before scoring?. RLAG rewards explanation quality, not just token-level answer correctness, which is what lets domain knowledge actually internalize rather than surface-fit Can reinforcement learning embed domain knowledge more effectively than supervised fine-tuning?. And post-completion learning goes further, training the model to compute its own reward internally rather than leaning on a brittle external RM at all Can models learn to evaluate their own work during training?.
The thread worth carrying away: reward models fail across domains not mainly because they're under-trained, but because outcome-only, absolute, scalar rewards encode the wrong thing — they capture *whether* an answer matched in one domain instead of *why* it was good, and 'why' is the only part that transfers.
Sources 9 notes
Binary correctness rewards incentivize high-confidence guessing because they don't penalize confident wrong answers. Adding the Brier score as a second reward term mathematically guarantees joint optimization of accuracy and calibration without trade-off.
Critique-GRPO shows that models stuck on performance plateaus can generate correct solutions when given chain-of-thought critiques, revealing that numerical rewards lack critical information about why failures occur and how to improve.
POLAR reframes reward modeling as policy discrimination: RMs assign higher scores to policies similar to a chosen target, eliminating absolute preference labels. Pre-trained 1.8B-7B parameter POLAR RMs substantially outperform non-pre-trained methods and transfer across task formulations.
Research shows RLVR improves sampling efficiency within existing capability boundaries without expanding them. A single training example suffices for activation, and spurious rewards work nearly as well as correct ones for models with appropriate pretraining.
Pass@k analysis shows base models outperform RLVR models at high k, indicating RLVR doesn't expand solvable problems but rather narrows sampling toward solutions already in the base model's distribution. Distillation, by contrast, genuinely transfers new reasoning patterns.
Show all 9 sources
Training with only negative samples consistently improves Pass@k across the spectrum, often matching full PPO and GRPO. Negative reinforcement suppresses incorrect trajectories while preserving diversity, whereas positive-only reinforcement degrades higher-k performance by concentrating probability mass.
Three independent teams (RRM, RM-R1, DeepSeek-GRM) discovered that adding chain-of-thought reasoning before reward scoring enables adaptive test-time compute scaling for evaluation. Reasoning-based approaches raise the capability ceiling of reward models beyond what outcome-based evaluation achieves.
RLAG rewards both answer accuracy and explanation rationality by cycling between augmented and unaugmented generation, progressively internalizing coherent knowledge structures. This outperforms SFT because it prioritizes reasoning quality over token-level correctness.
Post-Completion Learning exploits unused sequence space after model output to train self-assessment capabilities during training while maintaining zero inference cost. The model learns to compute its own reward functions, internalizing evaluation rather than relying on external reward models.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- Reward Reasoning Model
- RM-R1: Reward Modeling as Reasoning
- The Surprising Effectiveness of Negative Reinforcement in LLM Reasoning
- Efficient Reinforcement Learning via Large Language Model-based Search
- The Invisible Leash: Why RLVR May Not Escape Its Origin
- Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?
- Spurious Rewards: Rethinking Training Signals in RLVR
- Local Coherence or Global Validity? Investigating RLVR Traces in Math Domains