arXiv:2505.18757cs.CV2025-05被引 6

通过多样性与任务相关性,高效压缩视觉令牌,提升大模型推理速度。

ToDRE: Effective Visual Token Pruning via Token Diversity and Task Relevance

  • 分两阶段基于令牌多样性和任务相关性筛选关键视觉特征。
  • 可去除90%视觉编码器输出令牌及部分解码层令牌,提速2.6倍。
  • 无需训练,兼容性强,性能损失仅5%以内,适合部署优化。

视觉令牌剪枝旨在压缩冗余视觉信息,提升大视觉语言模型(LVLM)的推理效率。现有方法多依赖单一指标(如跨模态注意力或视觉令牌相似性)衡量冗余。本文指出,视觉令牌多样性与任务相关性是互补且独立的关键因素,应分别建模以实现更优剪枝。基于此,我们提出ToDRE——一种两阶段、无需训练的框架,结合令牌多样性与任务相关性进行高效剪枝。首先在视觉编码器后采用贪心最大求和多样化算法,保留一组多样且具代表性的视觉令牌;其次在大型语言模型(LLM)解码器特定层引入“信息迁移”机制,剔除任务无关的视觉令牌。大量实验表明,ToDRE可在视觉编码器后剪枝90%的视觉令牌,并清除部分解码层所有视觉令牌,使总推理时间提升2.6倍,同时保持95.0%的模型性能,且具备优异的模型兼容性。

原文摘要 · Abstract (English)

Visual token pruning aims to compress and prune redundant visual tokens which play a critical role in efficient inference with large vision-language models (LVLMs). However, most existing work estimates visual redundancy using a single metric, such as cross-modal attention or visual token similarity. We show that visual token diversity and task-specific token relevance are two crucial yet orthogonal factors that complement each other in conveying useful information and should therefore be treated separately for more effective visual token pruning. Building upon this insight, we design TODRE, a two-stage and training-free framework that incorporates Token Diversity and task RElevance for effective token compression and efficient LVLM inference. Instead of pruning redundant tokens, we introduce a greedy max-sum diversification algorithm that selects and retains a subset of diverse and representative visual tokens after the vision encoder. On top of that, ToDRE leverages an "information migration" mechanism to eliminate task-irrelevant visual tokens within certain decoder layers of large language model(LLM) to further improve token pruning and LVLM inference. Extensive experiments show that ToDRE prunes 90% of visual tokens after the vision encoder as well as all visual tokens in certain LLM decoder layers, leading to a 2.6x speed-up in total inference time while maintaining 95.0% model performance plus excellent model compatibility.

视觉剪枝大模型优化令牌压缩高效推理

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