mlsanityData to 14 Oct 2026

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

arXiv 2603.05659 ↗First posted 5 Mar 2026cs.CV cs.AI cs.LGcited by 1

On the map: LLM alignment / RLHF / preference optimisation → Reward hacking and misspecification

Abstract (arXiv)

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 error counting a reliable reward. As a case study, we validate IEC on virtual try-on (VTO), a domain that is simultaneously too constrained for holistic scoring and too permissive for rubric-based evaluation: subtle garment errors are unacceptable, yet many output variations are correct. We introduce Cascaded Error Counting (CEC) as an evaluation metric, which tracks human preferences well (60% top-1 vs. 30% others), and curate Mismatch-DressCode (MDressBench), a benchmark with maximal attribute mismatch to stress-test reward designs. On MDressBench, IEC outperforms RaR across all metrics (CEC: 5.31 vs. 5.60 on flat references; 5.20 vs. 5.53 on non-flat). On VITON-HD and DressCode, IEC matches or surpasses six baselines on 6 of 8 perceptual metrics. These results suggest that when ideal answers are unavailable, counting errors provide a stronger signal than constructing rubrics.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Reward hacking and misspecification, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 28 of its 51 references that are in the map. First posted on arXiv 5 Mar 2026.

Builds on

28 of 51 references.

References · 28

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  2. 2022Flow Matching for Generative Modelingcited by 5,702
  3. 2025Qwen-Image Technical Reportcited by 1,044
  4. 2025FLUX.1 Kontext: Flow Matching for In-Context Image Generation and Editing in Latent Spacecited by 1,006
  5. 2023Training Diffusion Models with Reinforcement Learningcited by 982
  6. 2023Human Preference Score v2: A Solid Benchmark for Evaluating Human Preferences of Text-to-Image Synthesiscited by 890
  7. 2023Diffusion Model Alignment Using Direct Preference Optimizationcited by 790
  8. 2025Flow-GRPO: Training Flow Matching Models via Online RLcited by 661
  9. 2025DanceGRPO: Unleashing GRPO on Visual Generationcited by 413
  10. 2025Rubrics as Rewards: Reinforcement Learning Beyond Verifiable Domainscited by 366
  11. 2025DiffusionNFT: Online Diffusion Reinforcement with Forward Processcited by 230
  12. 2025Unified Reward Model for Multimodal Understanding and Generationcited by 199
16 more
  1. 2025MixGRPO: Unlocking Flow-based GRPO Efficiency with Mixed ODE-SDEcited by 178
  2. 2024OOTDiffusion: Outfitting Fusion based Latent Diffusion for Controllable Virtual Try-oncited by 151
  3. 2023TryOnDiffusion: A Tale of Two UNetscited by 141
  4. 2025DR Tulu: Reinforcement Learning with Evolving Rubrics for Deep Researchcited by 114
  5. 2025Reinforcement Learning with Rubric Anchorscited by 113
  6. 2024CatVTON: Concatenation Is All You Need for Virtual Try-On with Diffusion Modelscited by 102
  7. 2025Uniworld-V2: Reinforce Image Editing with Diffusion Negative-aware Finetuning and MLLM Implicit Feedbackcited by 79
  8. 2025GRPO-Guard: Mitigating Implicit Over-Optimization in Flow Matching via Regulated Clippingcited by 49
  9. 2025TreeGRPO: Tree-Advantage GRPO for Online RL Post-Training of Diffusion Modelscited by 31
  10. 2025QA-LIGN: Aligning LLMs through Constitutionally Decomposed QAcited by 28
  11. 2025CatV2TON: Taming Diffusion Transformers for Vision-Based Virtual Try-On with Temporal Concatenationcited by 25
  12. 2025OneReward: Unified Mask-Guided Image Generation via Multi-Task Human Preference Learningcited by 23
  13. 2024Diffuse to Choose: Enriching Image Conditioned Inpainting in Latent Diffusion Models for Virtual Try-Allcited by 11
  14. 2025SuperFlow: Training Flow Matching Models with RL on the Flycited by 10
  15. 2026CoCoEdit: Content-Consistent Image Editing via Region Regularized Reinforcement Learningcited by 3
  16. 2025DiT-VTON: Diffusion Transformer Framework for Unified Multi-Category Virtual Try-On and Virtual Try-All with Integrated Image Editingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026RLVR2: Reinforcement Learning with Verifiable Rubric-based Ranking
  2. 2026Step-wise Rubric Rewards for LLM Reasoning
  3. 2025Position: The Hidden Costs and Measurement Gaps of Reinforcement Learning with Verifiable Rewards
  4. 2026Reward Hacking in Rubric-Based Reinforcement Learning
  5. 2026Not Every Rubric Teaches Equally: Policy-Aware Rubric Rewards for RLVR
  6. 2026ComplexConstraints and Beyond: Expert Rubrics for RLVR
  7. 2026Alternating Reinforcement Learning for Rubric-Based Reward Modeling in Non-Verifiable LLM Post-Training
  8. 2026AMARIS: A Memory-Augmented Rubric Improvement System for Rubric-Based Reinforcement Learning