跳到正文
HuggingFace Daily Papers(社區熱門論文)·· 2026-10-15AI 評分33

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

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

AI 導讀

OmniVerifier-C1 將複雜的多模態規則分解為逐點評分,並以解耦式強化學習訓練分級視覺驗證器,提升對分佈外多模態批評任務的泛化能力。研究亦指出,若有真實圖像可供比較,成對驗證比逐點驗證能提供更準確的批評;迷宮和數獨等結構化世界建模任務的實驗驗證了這一方法的成效。

正文

Published on Oct 15

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 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.

View arXiv page View PDF Add 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 paper 0

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 paper 0

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 paper 0

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 paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.

來源:HuggingFace Daily Papers(社區熱門論文) · huggingface.co