- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Dual-View Anchored Decoding (DVAD), a training-free method for mitigating object hallucinations in multimodal large language models. It constructs an uncertainty-suppressed anchor view by masking visual tokens with high KL divergence from the image-level consensus, while preserving the original full view. The two views are decoded jointly, and their logits are fused using an architecture-dependent coefficient: positive for dense-token models and negative for sparse-token models. Experiments on three MLLMs demonstrate reductions in object hallucination with relatively low inference overhead.
Critical strengths
-
A simple and efficient training-free decoding framework. DVAD combines uncertainty-guided visual token masking with dual-view decoding without requiring additional training. Experiments across three MLLMs show consistent hallucination reductions with limited reported inference overhead.
-
Evaluation of the hallucination–coverage trade-off. The paper evaluates both hallucination reduction and object coverage across multiple benchmarks, rather than focusing solely on hallucination rates. The ablation studies further examine the effects of different masking strategies and decoding components, providing useful evidence for the effectiveness of the proposed design.
Critical weaknesses
-
Limited novelty compared with existing decoding methods. The observation that high-uncertainty visual tokens may contain useful information has already been discussed in Dropout Decoding. Moreover, DVAD's logit fusion largely follows the established VCD formulation, particularly when the fusion coefficient is negative. Thus, the method appears to be an incremental combination of existing techniques.
-
Insufficient validation of the architecture-dependent fusion strategy. The main distinguishing design of DVAD is the use of opposite fusion directions for dense- and sparse-token architectures. However, experiments on only one dense-token and two sparse-token models provide limited evidence that token compression explains this distinction. Additionally, the reported efficiency advantage over Dropout Decoding may partly result from comparing batched decoding with sequential execution.
Questions for authors
-
Novelty Beyond Existing Decoding Methods. Given the overlap with Dropout Decoding and VCD, could the authors clarify the distinctive methodological contribution of DVAD beyond combining uncertainty-guided masking with conventional dual-view logit fusion?
-
Validation of the Fusion Strategy and Efficiency. Could the authors provide more controlled experiments to validate the architecture-dependent sign selection, particularly across additional architectures or different visual-token compression levels? Additionally, how does DVAD's inference efficiency compare with Dropout Decoding under matched batching implementations?
I haven’t seen a response yet.