OmniVerifier-C1: Decomposed Graded Verifier for Rule-Governed Generative World Modeling

Hugging Face Daily Papers Papers

Summary

提出 OmniVerifier-C1,一种将复杂多模态规则分解为逐点评分的分级视觉验证器,通过解耦强化学习与成对验证提升规则驱动的生成式世界建模的准确性与泛化能力。

Generative visual verifiers play a crucial role in advancing multimodal intelligence. To enhance the robustness of visual verifiers in complex multimodal scenarios involving compositional requirements, we move beyond conventional binary verifiers that produce only True/False discrete judgments and introduce a verifier that automatically decomposes complex prompts or environmental rules into fine-grained components and assigns pointwise scores to provide a continuous and more informative critique signal. Our experiments further demonstrate that these structured and interpretable outputs improve the verifier's generalization to out-of-domain multimodal critic tasks. To train this verifier, we introduce a Decoupled RL training strategy that jointly optimizes sub-question-level binary judgment and global alignment scoring, using precise local feedback to develop fine-grained verification capabilities that provide a foundation for reliable continuous scoring at the global level. Under a general reinforcement learning framework, we first empirically demonstrate that the proposed pointwise graded verifier significantly outperforms binary verifiers in traditional text-to-image scenarios. We then extend our investigation to rule-governed generative world modeling where generative models are leveraged for world simulation and world reasoning under explicit rules. From a theoretical standpoint, we further show that a pairwise verification paradigm yields more accurate critiques than the pointwise formulation when ground-truth images are available, with empirical results on diverse structured world-modeling tasks such as Maze and Sudoku further validating the effectiveness of our approach. Overall, our findings suggest a key insight: the transition from generative models to structured world-modeling agents critically hinges on the availability of accurate pairwise graded visual verifiers.
Original Article
View Cached Full Text

Cached at: 10/16/26, 11:03 AM

Paper page - OmniVerifier-C1: Decomposed Graded Verifier for Rule-Governed Generative World Modeling

Source: https://huggingface.co/papers/2610.22355 Authors:

,

,

,

,

,

,

,

,

,

,

Abstract

A graded visual verifier decomposes complex multimodal rules into pointwise scores and uses decoupled reinforcement learning to improve generalization, with pairwise verification further enhancing structured world-modeling accuracy.

Generative visual verifiers play a crucial role in advancingmultimodal intelligence. To enhance the robustness of visual verifiers in complex multimodal scenarios involvingcompositional requirements, we move beyond conventional binary verifiers that produce only True/False discrete judgments and introduce a verifier that automatically decomposes complex prompts or environmental rules into fine-grained components and assignspointwise scoresto provide a continuous and more informative critique signal. Our experiments further demonstrate that these structured and interpretable outputs improve the verifier’s generalization to out-of-domain multimodal critic tasks. To train this verifier, we introduce aDecoupled RLtraining strategy that jointly optimizessub-question-level binary judgmentandglobal alignment scoring, using precise local feedback to develop fine-grained verification capabilities that provide a foundation for reliable continuous scoring at the global level. Under a general reinforcement learning framework, we first empirically demonstrate that the proposed pointwise graded verifier significantly outperforms binary verifiers in traditionaltext-to-imagescenarios. We then extend our investigation torule-governed generative world modelingwhere generative models are leveraged for world simulation and world reasoning under explicit rules. From a theoretical standpoint, we further show that apairwise verificationparadigm yields more accurate critiques than the pointwise formulation when ground-truth images are available, with empirical results on diversestructured world-modelingtasks such as Maze and Sudoku further validating the effectiveness of our approach. Overall, our findings suggest a key insight: the transition from generative models tostructured world-modelingagents critically hinges on the availability of accurate pairwise graded visual verifiers.

View arXiv pageView PDFAdd to collection

Get this paper in your agent:

hf papers read 2610\.22355

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2610.22355 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2610.22355 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2610.22355 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

Verifier-Grounded Agentic RL for Provably Correct Code

arXiv cs.LG

提出一种以程序验证器为奖励信号的智能体强化学习框架,通过读取验证器诊断信息(而非二元判决)并加入完整性审计,显著提升Qwen3系列模型在DafnyBench和SWE-Proof等验证基准上的正确率(最高达100%)。

VeriGate: Verifier-Gated Step-Level Supervision for GRPO

arXiv cs.LG

VeriGate extends GRPO with verifier-gated step-level supervision, providing fine-grained credit assignment when verifier rewards are degenerate. It achieves substantial accuracy improvements on reasoning benchmarks for 1.5B and 7B models.

Beyond the Verdict: Agentic Code Judging with Verifiable Feedback

Hugging Face Daily Papers

该论文提出了一个让模型仅凭题面和源码判断并诊断候选程序正确性、并以生成反例作为可验证证据的任务,构建了 USACO-JUDGE 基准,并训练了 35B MoE 代理验证器 ARBITER,显著提升了代码验证、选择与改进效果。