arXiv:2506.01097cs.CV2025-06中稿 · ICLR被引 2

用可解释性方法在输入端压缩视觉令牌,提速又省资源。

Task-Related Token Compression in Multimodal Large Language Models from an Explainability Perspective

  • 用注意力解释方法评估视觉令牌重要性,指导任务相关压缩
  • 输入阶段压缩可减少90%以上无关令牌,性能几乎无损
  • 轻量卷积网络快速学习映射,无需改动模型架构

现有多模态大模型处理大量视觉令牌,导致计算成本高、效率低。指令相关视觉令牌压缩具有强任务相关性,契合模型指令跟随目标。以往工作普遍认为视觉令牌在浅层语言模型中对齐效果更好,因此压缩多集中在中间层。本文揭示:通过合理选择,任务相关压缩可在语言模型输入阶段实现,性能损失极小。该新范式显著减少任务无关视觉令牌,且模型无关设计无需修改模型结构。具体而言,我们提出利用基于Transformer的可解释性方法评估每个视觉令牌相对于指令的全局重要性,有效指导多模态大模型的任务相关压缩。进一步提出从第一层语言模型注意力图到解释结果的学习映射,避免完整推理流程。该映射可通过简单轻量的卷积网络学习,训练高效且与多模态大模型解耦。在三个主流多模态大模型(Qwen2-VL、LLaVA-OneVision、VILA1.5)上的13个图像和视频基准测试中,验证了方法卓越的有效性与强泛化能力。此外,新压缩范式实现更快推理,预填充时间与键值缓存内存均显著降低。

原文摘要 · Abstract (English)

Existing Multimodal Large Language Models (MLLMs) process a large number of visual tokens, leading to significant computational costs and inefficiency. Instruction-related visual token compression demonstrates strong task relevance, which aligns well with MLLMs ultimate goal of instruction following. Previous works generally assume that visual tokens achieve better vision-language alignment in the shallow layers of LLMs, which have led to task-related token compression being primarily applied in intermediate LLM layers. In contrast, our study reveals that with proper selection, task-related token compression is feasible at the input stage of LLM with negligible performance loss. This new paradigm significantly reduces task-irrelevant visual tokens and its model-agnostic design enables application without modifying the LLM architecture. Specifically, we suggest that explainability methods for transformer-based architechtures can evaluate the global importance of each visual token with respect to the given instruction, which can effectively guide the task-related token compression for MLLMs. Furthermore, we propose to learn a mapping from the attention map of the first LLM layer to the explanation results, thereby avoiding the need for a full inference pass. Interestingly, this mapping can be learned using a simple and lightweight convolutional network, whose training is efficient and independent of MLLMs. Extensive experiments on 13 image and video benchmarks across three leading MLLMs (Qwen2-VL, LLaVA-OneVision, and VILA1.5) demonstrate the remarkable effectiveness and strong generalization of our approach. Additionally, our new compression paradigm achieves faster inference with reductions in both prefilling time and KV cache memory.

多模态压缩可解释性推理加速

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