用条件多样性提升视觉标记剪枝效果,显著降低多模态模型推理开销。
Beyond Attention or Similarity: Maximizing Conditional Diversity for Token Pruning in MLLMs
- 基于指令条件下的视觉标记多样性,用DPP重构剪枝问题
- 在LLaVA上实现95%算力降低、78%延迟减少,精度保持94%
- 无需训练、兼容多种模型,适合高效率多模态应用
在多模态大语言模型(MLLMs)中,视觉标记长度远超文本标记,导致高推理成本。现有方法依赖注意力或相似性剪枝,前者保留冗余重复标记,后者忽略指令相关性,性能不佳。本文提出一种新方法CDPruner,超越注意力与相似性,通过最大化条件多样性实现剪枝。定义指令条件下的视觉标记条件相似性,将剪枝问题重构为确定性点过程(DPP),以优化所选子集的多样性。该方法无需训练、模型无关,可广泛应用于各类MLLM。在多个主流视觉-语言基准测试中,CDPruner达到新最优性能。通过DPP最大化条件多样性,所选标记更准确反映输入图像且贴合用户指令,即使在极高压缩比下仍保持强表现。在LLaVA上,剪枝使FLOPs降低95%,CUDA延迟减少78%,精度保持原水平的94%。代码已开源:https://github.com/Theia-4869/CDPruner。
原文摘要 · Abstract (English)
In multimodal large language models (MLLMs), the length of input visual tokens is often significantly greater than that of their textual counterparts, leading to a high inference cost. Many works aim to address this issue by removing redundant visual tokens. However, current approaches either rely on attention-based pruning, which retains numerous duplicate tokens, or use similarity-based pruning, overlooking the instruction relevance, consequently causing suboptimal performance. In this paper, we go beyond attention or similarity by proposing a novel visual token pruning method named CDPruner, which maximizes the conditional diversity of retained tokens. We first define the conditional similarity between visual tokens conditioned on the instruction, and then reformulate the token pruning problem with determinantal point process (DPP) to maximize the conditional diversity of the selected subset. The proposed CDPruner is training-free and model-agnostic, allowing easy application to various MLLMs. Extensive experiments across diverse MLLMs show that CDPruner establishes new state-of-the-art on various vision-language benchmarks. By maximizing conditional diversity through DPP, the selected subset better represents the input images while closely adhering to user instructions, thereby preserving strong performance even with high reduction ratios. When applied to LLaVA, CDPruner reduces FLOPs by 95\% and CUDA latency by 78\%, while maintaining 94\% of the original accuracy. Our code is available at https://github.com/Theia-4869/CDPruner.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。