通过控制视觉冗余提升多模态模型并行解码质量
Visual-Redundancy-Controlled Parallel Decoding for Diffusion-Based Multimodal Large Language Models

- 用视觉冗余指数衡量并行解码中视觉信息重叠度
- 在不增加训练成本前提下,使长文本生成准确率提升18.8%
- 适合关注多模态生成质量与推理效率的研究者
基于扩散的多模态大语言模型(dMLLMs)通过并行预测多个掩码位置的标记进行解码。每个解码步骤本质上是位置选择问题:模型需判断哪些预测可靠,以及哪些位置应共同提交作为后续解码的上下文。现有基于置信度的方法独立排序掩码位置并提交前K个,但忽略了所提交标记是否提供互补的视觉支撑。我们发现,在多模态场景中,同一解码步内高置信度标记可能依赖重叠的视觉信息,导致视觉冗余,减少后续解码可用的互补视觉线索。为此,我们提出视觉冗余指数(VRI)量化并行提交标记间的视觉接地重叠。进一步提出无需训练的推理阶段解码方法VRCD,利用标记-图像注意力优先选择视觉互补的位置。在多个多模态基准上,VRCD有效降低视觉冗余和剩余位置熵,带来轻微运行开销。在长序列生成实验中,相比置信度解码,其在M^3CoT上相对准确率提升18.8%,在MMBench上提升6.9%。代码已开源。
原文摘要 · Abstract (English)
Diffusion-based multimodal large language models (dMLLMs) decode by iteratively predicting tokens at multiple masked positions in parallel. This turns each decoding step into a position-selection problem: the model must choose not only which predictions are reliable in isolation, but also which positions should be committed together as context for later decoding steps. Existing confidence-based decoding ranks masked positions independently and commits the top-K positions, largely ignoring whether the committed tokens provide complementary visual grounding. We identify a step-level limitation of this strategy in multimodal settings: high-confidence tokens selected in the same step can rely on overlapping visual grounding, introducing visual redundancy among the committed tokens and leaving less complementary visual grounding available for later decoding. To quantify this effect, we introduce the Visual Redundancy Index (VRI), which measures visual grounding overlap among tokens committed in parallel. To control this redundancy during decoding, we propose Visual-Redundancy-Controlled Decoding (VRCD), a training-free inference-time decoding method that uses token-to-image attention to prioritize visually complementary positions. Across diverse multimodal benchmarks, VRCD reduces visual redundancy and remaining-position entropy with modest runtime overhead. In longer decoding experiments, it also achieves relative accuracy gains of up to 18.8% on M^3CoT and 6.9% on MMBench over confidence-based decoding. Code is available at https://github.com/infiniteYuanyl/VRCD.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。