arXiv:2603.16253cs.CVcs.AI2026-03被引 3

让视觉语言模型看清自己看错了什么,避免误判推理对错。

Grounding the Score: Explicit Visual Premise Verification for Reliable Vision-Language Process Reward Models

  • 用视觉检查清单显式验证每步依赖的图像事实
  • 通过图像约束匹配计算可靠性信号,动态调节评分
  • 提升多模态推理的准确率和错误定位能力,适合复杂视觉任务

视觉语言过程奖励模型(VL-PRMs)被广泛用于评估中间推理步骤并重排序候选结果。然而,它们常作为黑箱评判:低分可能源于真实推理错误,也可能是模型对图像的误判。这种感知与推理的混淆导致系统性假阳性(奖励幻觉前提)和假阴性(惩罚正确接地陈述),损害重排序与错误定位效果。本文提出显式视觉前提验证(EVPV),一种轻量级验证接口,使步骤评分依赖于所依赖视觉前提的可靠性。策略被提示生成逐步视觉检查清单,以明确所需视觉事实;同时,约束提取器从输入图像中独立推导结构化视觉约束。EVPV将检查清单声明与约束匹配,计算标量视觉可靠性信号,并通过可靠性门控校准奖励:当可靠性低时降低视觉依赖步骤的奖励,高时则保留。该方法在不进行每步工具调用的情况下,解耦了感知不确定性与逻辑评估。在VisualProcessBench及六个多模态推理基准上的实验表明,EVPV提升了步骤级验证性能,并持续优于强基线的Best-of-N重排序准确率。进一步地,向提取的约束注入可控破坏后,性能单调下降,为收益源于约束保真度与显式前提验证提供了因果证据。代码已开源。

原文摘要 · Abstract (English)

Vision-language process reward models (VL-PRMs) are increasingly used to score intermediate reasoning steps and rerank candidates under test-time scaling. However, they often function as black-box judges: a low step score may reflect a genuine reasoning mistake or simply the verifier's misperception of the image. This entanglement between perception and reasoning leads to systematic false positives (rewarding hallucinated visual premises) and false negatives (penalizing correct grounded statements), undermining both reranking and error localization. We introduce Explicit Visual Premise Verification (EVPV), a lightweight verification interface that conditions step scoring on the reliability of the visual premises a step depends on. The policy is prompted to produce a step-wise visual checklist that makes required visual facts explicit, while a constraint extractor independently derives structured visual constraints from the input image. EVPV matches checklist claims against these constraints to compute a scalar visual reliability signal, and calibrates PRM step rewards via reliability gating: rewards for visually dependent steps are attenuated when reliability is low and preserved when reliability is high. This decouples perceptual uncertainty from logical evaluation without per-step tool calls. Experiments on VisualProcessBench and six multimodal reasoning benchmarks show that EVPV improves step-level verification and consistently boosts Best-of-N reranking accuracy over strong baselines. Furthermore, injecting controlled corruption into the extracted constraints produces monotonic performance degradation, providing causal evidence that the gains arise from constraint fidelity and explicit premise verification rather than incidental prompt effects. Code is available at: https://github.com/Qwen-Applications/EVPV-PRM

多模态推理奖励模型视觉验证可信AI

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。