arXiv:2602.00946cs.CV2026-02

通过融合视觉与跨模态注意力,高效压缩视觉语言模型的冗余信息。

ConsensusDrop: Fusing Visual and Cross-Modal Saliency for Efficient Vision Language Models

  • 利用视觉编码器与跨模态注意力的共识信号选择关键视觉标记
  • 在相同标记预算下优于现有方法,极端压缩时仍保持接近基线精度
  • 无需训练,适用于多种开源视觉语言模型,提升推理效率

视觉语言模型(VLMs)成本高昂,因大语言模型需处理数百个高度冗余的视觉标记。现有标记压缩方法通常仅依赖视觉编码器显著性(范围广但与查询无关)或大语言模型跨注意力(查询相关但稀疏且昂贵)。我们发现单一信号均不充分:融合两者能持续提升性能。然而,实际融合颇具挑战——跨模态显著性通常仅在大语言模型内部可用(过晚无法用于高效预-大语言模型剪枝),且两信号本质不对称,简单融合会低估其互补优势。本文提出ConsensusDrop,一种免训练框架,通过协调视觉编码器显著性与查询感知跨注意力,生成共识排序,保留最有效标记,并通过编码器引导合并其余标记。在LLaVA-1.5/NeXT、Video-LLaVA等多个开源VLM上,ConsensusDrop在相同标记预算下持续优于先前剪枝方法,实现更强的精度-效率权衡:即使在激进标记压缩下也保持近基线准确率,同时降低首字延迟(TTFT)和键值缓存占用。代码将开源。

原文摘要 · Abstract (English)

Vision-Language Models (VLMs) are expensive because the LLM processes hundreds of largely redundant visual tokens. Existing token reduction methods typically exploit \textit{either} vision-encoder saliency (broad but query-agnostic) \textit{or} LLM cross-attention (query-aware but sparse and costly). We show that neither signal alone is sufficient: fusing them consistently improves performance compared to unimodal visual token selection (ranking). However, making such fusion practical is non-trivial: cross-modal saliency is usually only available \emph{inside} the LLM (too late for efficient pre-LLM pruning), and the two signals are inherently asymmetric, so naive fusion underutilizes their complementary strengths. We propose \textbf{ConsensusDrop}, a training-free framework that derives a \emph{consensus} ranking by reconciling vision encoder saliency with query-aware cross-attention, retaining the most informative tokens while compressing the remainder via encoder-guided token merging. Across LLaVA-1.5/NeXT, Video-LLaVA, and other open-source VLMs, ConsensusDrop consistently outperforms prior pruning methods under identical token budgets and delivers a stronger accuracy-efficiency Pareto frontier -- preserving near-baseline accuracy even at aggressive token reductions while reducing TTFT and KV cache footprint. Our code will be open-sourced.

视觉语言模型标记压缩多模态推理优化

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