When Rubrics Fail: Error Enumeration as Reward in Reference-Free RL Post-Training for Virtual Try-On
Wisdom Ikezogwo, Mehmet Saygin Seyfioglu, Ranjay Krishna, Karim Bouyarmane

TL;DR
This paper introduces Implicit Error Counting (IEC), a novel reward method for reference-free reinforcement learning, validated on virtual try-on tasks where traditional rubrics are ineffective.
Contribution
IEC provides a new error enumeration approach that improves reward stability and effectiveness in tasks lacking single ideal outputs, demonstrated through virtual try-on benchmarks.
Findings
IEC outperforms rubric-based rewards on MDressBench.
IEC matches or surpasses baselines on perceptual metrics.
Cascaded Error Counting (CEC) correlates well with human preferences.
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. But many real-world tasks admit multiple valid outputs and lack the single ideal answer that rubric generation depends on. We identify this reference-free setting as a gap in current post-training methods and propose Implicit Error Counting (IEC) to fill it. Instead of checking what a response gets right against a rubric, IEC enumerates what it gets wrong, applying severity-weighted scores across task-relevant axes and converting them into calibrated per-aspect rewards. We show that na\"ive explicit enumeration is too noisy for stable optimization, and that two design choices: implicit score emission and group calibration are necessary to make…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
