arXiv:2510.20707cs.CV2025-10中稿 · ICLR被引 14

提出兼顾重要性与多样性的KV缓存压缩方法,提升多模态大模型推理效率。

Mixing Importance with Diversity: Joint Optimization for KV Cache Compression in Large Vision-Language Models

  • 通过融合重要性与多样性,动态平衡不同注意力头的冗余信息
  • 极端压缩下(预算64)平均提升5.1%,GUI任务最高增益达9.0%
  • 适用于多模态与纯文本大模型,部署灵活

近期的大规模多模态视觉语言模型(LVLMs)在处理长序列方面表现出色,但随之产生的键值(KV)缓存膨胀带来严重的内存瓶颈,制约了实际部署。现有压缩方法主要依赖保留高重要性KV对以减少存储,却忽视了多模态场景中特有的语义冗余模式。本文分析发现,除了重要性外,不同注意力头间存在差异化的冗余水平。仅依赖重要性会遗漏部分语义信息分布。为此,我们提出MixKV,一种将重要性与多样性结合的新型压缩方法,可自适应各注意力头的语义冗余特性,在压缩时动态权衡多样性与重要性。大量实验表明,MixKV在多个LVLM上均优于现有方法。在极端压缩(预算=64)条件下,跨五个多模态理解基准平均提升5.1%,在GUI定位任务中对SnapKV和AdaKV分别提升8.0%和9.0%,且推理效率相当。此外,MixKV可无缝扩展至纯语言模型,获得类似性能提升。代码已开源:https://github.com/xuyang-liu16/MixKV。

原文摘要 · Abstract (English)

Recent large vision-language models (LVLMs) demonstrate remarkable capabilities in processing extended multi-modal sequences, yet the resulting key-value (KV) cache expansion creates a critical memory bottleneck that fundamentally limits deployment scalability. While existing KV cache compression methods focus on retaining high-importance KV pairs to minimize storage, they often overlook the modality-specific semantic redundancy patterns that emerge distinctively in multi-modal KV caches. In this work, we first analyze how, beyond simple importance, the KV cache in LVLMs exhibits varying levels of redundancy across attention heads. We show that relying solely on importance can only cover a subset of the full KV cache information distribution, leading to potential loss of semantic coverage. To address this, we propose MixKV, a novel method that mixes importance with diversity for optimized KV cache compression in LVLMs. MixKV adapts to head-wise semantic redundancy, selectively balancing diversity and importance when compressing KV pairs. Extensive experiments demonstrate that MixKV consistently enhances existing methods across multiple LVLMs. Under extreme compression (budget=64), MixKV improves baseline methods by an average of 5.1% across five multi-modal understanding benchmarks and achieves remarkable gains of 8.0% and 9.0% for SnapKV and AdaKV on GUI grounding tasks, all while maintaining comparable inference efficiency. Furthermore, MixKV extends seamlessly to LLMs with comparable performance gains. Our code is available at https://github.com/xuyang-liu16/MixKV.

KV缓存压缩多模态模型注意力机制

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