arXiv:2611.06244v1 Announce Type: cross
Abstract: Reinforcement learning with verifiable rewards (RLVR) has led to significant gains in math and code generation. Extending these gains to open-ended domains remains challenging: ground-truth verification is unavailable, human annotation is expensive, and learned reward models are prone to reward hacking. The generation-verification gap, where judging good outputs is easier than producing them, offers a potential path to improvement. However, rubric-based judges are often imprecise and stationary, so policies can overfit or reward hack them. We introduce Rubric Curriculum RL (RcRL), which exploits this gap without new data, human annotations, or stronger teacher models. We combine pairwise preferences over rollouts with a curriculum over rubric criteria, yielding a more discriminative signal than absolute scoring and a non-stationary objective. Whereas baselines plateau within a few hundred steps, RcRL preserves output entropy and keeps improving past 1000 steps. On creative writing, RcRL achieves a 70.5% human win rate against the base model, with gains across benchmarks and judges. On HealthBench, RcRL improves over the base model by 14.6% (full set) and 25.4% (consensus subset), outperforming all training baselines, including instance-specific rubrics.
arxiv
Rubric Curriculum RL Improves RLVR in Non-Verifiable Domains
The paper introduces Rubric Curriculum RL (RcRL), a method that exploits the generation-verification gap in domains without ground-truth rewards by combining pairwise preferences over rollouts with a curriculum over rubric criteria. This creates a more discriminative and non-stationary training signal, avoiding the plateau seen in baselines. RcRL achieves a 70.5% human win rate on creative writing and improves HealthBench performance by 14.6% (full set) and 25.4% (consensus subset), outperforming all training baselines.
This presents a concrete, novel training method with measurable gains in open-ended domains, addressing a key limitation of RLVR.
Comments & Questions (0)
No comments yet
Be the first to comment!