English

RVPO: Risk-Sensitive Alignment via Variance Regularization

Machine Learning 2026-05-08 v1 Computation and Language

Abstract

Current critic-less RLHF methods aggregate multi-objective rewards via an arithmetic mean, leaving them vulnerable to constraint neglect: high-magnitude success in one objective can numerically offset critical failures in others (e.g., safety or formatting), masking low-performing "bottleneck" rewards vital for reliable multi-objective alignment. We propose Reward-Variance Policy Optimization (RVPO), a risk-sensitive framework that penalizes inter-reward variance during advantage aggregation, shifting the objective from "maximize sum" to "maximize consistency." We show via Taylor expansion that a LogSumExp (SoftMin) operator effectively acts as a smooth variance penalty. We evaluate RVPO on rubric-based medical and scientific reasoning with up to 17 concurrent LLM-judged reward signals (Qwen2.5-3B/7B/14B) and on tool-calling with rule-based constraints (Qwen2.5-1.5B/3B). By preventing the model from neglecting difficult constraints to exploit easier objectives, RVPO improves overall scores on HealthBench (0.261 vs. 0.215 for GDPO at 14B, p<0.001p < 0.001) and maintains competitive accuracy on GPQA-Diamond without the late-stage degradation observed in other multi-reward methods, demonstrating that variance regularization mitigates constraint neglect across model scales without sacrificing general capabilities.

Keywords

Cite

@article{arxiv.2605.05750,
  title  = {RVPO: Risk-Sensitive Alignment via Variance Regularization},
  author = {Ivan Montero and Tomasz Jurczyk and Bhuwan Dhingra},
  journal= {arXiv preprint arXiv:2605.05750},
  year   = {2026}
}

Comments

17 pages, 5 figures

R2 v1 2026-07-01T12:54:12.981Z