Skip to content

SAVOR: Self-Aware Visual Grounding via Confidence-Calibrated Reinforcement Learning for Multimodal Hallucination Mitigation

Sep 2026 · arXiv.org · Vol abs/2609.16601 · 0 citations · 56 references
Computer Science

TL;DR

Savor is introduced, a training framework that augments the output schema with token and answer confidence, optimises the policy with a Group Relative Policy Optimisation objective that penalises calibration error and poor abstention decisions, and uses the learned confidence at inference time to revisit visual evidence only when the model is uncertain.

Abstract

Multimodal large language models (MLLMs) have made strong progress on visual question answering and image captioning, yet they still produce fluent claims about objects, attributes, or relations that are not grounded in the image. Many remedies either modify decoding at test time, which adds latency, or fine tune with preferences such as DPO variants, which teach which answer is preferred but not when the model's own answer is unreliable. We argue that calibrated self assessment is the missing signal. We introduce Savor, a training framework that (i) augments the output schema with token and answer confidence, (ii) optimises the policy with a Group Relative Policy Optimisation (GRPO) objective that penalises calibration error and poor abstention decisions, and (iii) uses the learned confidence at inference time to revisit visual evidence only when the model is uncertain. Experiments on POPE, HallusionBench, AMBER and MMHal-Bench across two recent backbones (InternVL3-8B and Qwen3-VL-8B) show that Savor reduces hallucination while preserving general capability on MME and MMBench, with lower Expected Calibration Error than DPO and decoding baselines.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

EviAnchor: Mitigating Hallucinations in Large Vision-Language Models via Regional Visual Evidence Compensation

EviAnchor is proposed, a training-free and single-branch inference framework that preserves and reactivates visual evidence throughout generation in large vision-language models and demonstrates consistent improvements in visual grounding.

Sihang Jia, Shu-Liang Liu, Song-Bo Yang et al. · 0 citations
Preprint Sep 2026

What Do Hallucinations Reveal About Multimodal Reasoning? Diagnosing Visual Grounding Failures via Contrastive Decoding Probes

When strong multimodal models are widely available, progress requires new scientific methodologies beyond benchmark scores---using models as instruments for understanding behavior. We address this by asking: can we use large vision-language models (LVLMs) as experimental instruments for studying their own failure dynam...

Zhi-Peng Zhao, Wen-Xu Wang, Peishun Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Alleviating Hallucination in Reasoning Tasks with Training-Free Uncertainty-Guided Steering

USteer, a simple, training-free steering mechanism that adjusts a model's layer-wise activations during inference using the gradient of a confidence measure with respect to the activations, demonstrates that confidence signals can be leveraged not only for detection, but also for effective inference-time control of mod...

Li-Tian Liu, Qi-Qi Hou, Yu-Bin Jian et al. · 0 citations
Conference Aug 2026

V-Rubrics: Visual Faithfulness via Rubric-Based Reinforcement Learning

This work introduces Visual Rubrics-Based Reinforcement Learning, which decomposes reference responses into atomic propositions and scores generated answers along Visual Faithfulness, Reasoning Consistency, and Instruction Following, and shows rubrics as a useful reward abstraction for visual post-training.

Shu-Lin Tian, Ming-Lu Li, Yuhao Dong et al. · 1 citation
#computer vision Preprint Aug 2026

LookBack: Where and How to Score LVLM Responses via Visual Reference Usage

LookBack, a training-free LVLM response scoring method that augments token likelihood with visual lookback score, a lightweight measure of how strongly each response token refers to image tokens, consistently improves Best-of-$N$ selection over existing baselines with negligible additional overhead.

Beomsik Cho, Jin-Ha Kim, Dongseok Lee et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.