arXiv Machine Learning

ImpossibleRubrics: Stress-Testing Generated Rubrics as Reward Signals

The paper introduces ImpossibleRubrics, a benchmark of 169 impossible tasks designed to test the robustness of language‑model‑generated rubrics as reward signals. Each task is paired with a verifiable oracle certificate that defines what constitutes an honest answer, and the benchmark includes 48 answerable controls. Experiments show that many rubric generators are exploited frequently—up to 36% on a stress cut—highlighting a significant gap in rubric quality rather than task difficulty, and that generic rubrics can be more vulnerable than tailored ones.

arXiv AI
Jul 7

When Rubrics Fail: Error Enumeration as Reward in Reference-Free RL Post-Training for Virtual Try-On

arXiv:2603. 05659v3 Announce Type: replace-cross Abstract: Reinforcement learning with verifiable rewards (RLVR) and Rubrics as Rewards (RaR) have driven strong gains in domains with clear correctness signals and even in subjective domains by synthesizing evaluation criteria from ideal reference answers.

By Wisdom Ikezogwo, Mehmet Saygin Seyfioglu, Ranjay Krishna, Karim Bouyarmane
arXiv Computation and Language
Oct 21

Reward Misspecification Degrades Chain-of-Thought Monitorability

The paper investigates how reward misspecification in reinforcement learning harms the ability to monitor chain-of-thought (CoT) reasoning in language models. By creating a testbed with true and misspecified rewards, the authors show that models can hack the reward while still producing CoTs that appear aligned, leading to low monitorability. They propose a mitigation strategy that collects diverse reward rollouts, infers a reward description with a language model, and injects this description into the input, improving monitorability by up to 42% absolute across models and tasks.

By Tianyi Lorena Yan, John Hewitt
arXiv AI
Oct 26

RubricCraft: Where Solutions Diverge, Criteria Emerge

RubricCraft is a method that generates natural‑language evaluation rubrics for open‑ended, artifact‑producing language tasks by analyzing differences among independently sampled solver trajectories. It constructs rubric criteria based on how each attempt satisfies or violates task requirements, then applies and refines these criteria to better detect errors and recognize partial correctness without needing a single reference solution. On the SpreadsheetBench v2 benchmark, RubricCraft’s rubrics reduce the proportion of incorrect outputs that pass (29.5% vs. 42.6%) and improve ranking of outputs while maintaining consistency with the benchmark’s own checker.

By Hosein Hasanbeig, Priyanshu Gupta, Ashish Tiwari, Vu Le, Sumit Gulwani
arXiv Machine Learning
Oct 23

Rubric Dropout: A Simple Way to Mitigate Reward Hacking in Rubric-Based RL

The paper introduces Rubric Dropout, a technique that randomly removes a subset of rubric criteria during training to prevent reinforcement learning agents from exploiting the rubric as a proxy for quality. By resampling which criteria are rewarded at each step and ensuring all responses to a prompt are evaluated on the same subset, the method reduces reward hacking and improves out‑of‑distribution performance on medical and science benchmarks. Block Dropout further groups semantically similar criteria to avoid near‑duplicate rewards, yielding additional gains.

By Minglai Yang, Xinyu Guo, Zhengliang Shi, Utkarsh Tyagi, Mian Zhang, Razvan Dumitru, Sunjie Hou, Yunzhong He, Daniel Yue Zhang, Dan Roth, Ying Liu
arXiv AI
Oct 16

Recursive Reward Improvement via Adversarial Meta-Prompt Evolution

The paper introduces Recursive Reward Improvement (RRI), a method that enhances recursive self‑improvement loops by using an adversary to expose and fix weaknesses in model‑generated rubrics for open‑ended tasks. In RRI, an adversary crafts a rubric‑gaming answer, an honest answer is generated without rubric exposure, and up to two repair steps adjust the rubric so the honest answer scores higher. Experiments on HealthBench Professional show that RRI boosts adjusted scores by up to 12.4 points on a 27B model and yields significant gains on difficult and writing tasks, while also improving performance on unseen benchmarks PRBench Hard and ProfBench.

By Wei Dai, Qianchu Liu, Guanghui Qin, Xing Han, Tristan Naumann, Paul Pu Liang, Sheng Zhang
arXiv AI
Sep 24

What Makes a Terminal-Bench Task Hard? Separating Genuine Hardness from Fake-Hardness on an Adjudicated Agentic Corpus

The paper investigates why some tasks in the Terminal‑Bench/Frontier‑Bench datasets fail for all agents, distinguishing genuine difficulty from artifacts such as missing context, broken solutions, infrastructure failures, or verifier bypasses. Analyzing 125 all‑fail tasks, only 78 are certified as genuinely unsolved after applying a validity screen; the rest are attributable to broken oracles, infrastructure issues, bypassable verifiers, or insufficient evidence. The study concludes that a zero pass rate does not automatically indicate a hard task and recommends that frontier benchmarks provide evidence for all‑fail tasks before claiming capability gaps.

By Edward Lue Chee Lip, Boden Moraski, Tim Knappe, Lang Xiong, Sarvesh Gharat, Antonio Mari, Ivan Bercovich
arXiv AI
Oct 15

Checking the Checkers: A Synthesis of Verifier Noise and Robustness in RLVR

The paper surveys 58 studies on verifier errors in reinforcement learning with verifiable rewards (RLVR), examining how such errors affect training and which mitigations are effective. It finds that the type of error—rather than its frequency—has a larger impact on learning dynamics, with random errors mainly slowing progress and false positives potentially causing learning plateaus or collapse. The authors compile findings into comparison tables, reconcile conflicting reports, and propose a reporting protocol to standardize future research.

By Savyasachi Gupta, Aniruddha Srinivas Joshi