arXiv:2605.16439cs.CVcs.AI2026-05

提出KVCapsule压缩视觉语言模型的键值缓存,提升推理效率。

KVCapsule: Efficient Sequential KV Cache Compression for Vision-Language Models with Asymmetric Redundancy

论文配图:KVCapsule: Efficient Sequential KV Cache Compression for Vision-Language Models with Asymmetric Redundancy
图 1 · 摘自论文原文
  • 针对视觉令牌冗余特性设计不对称压缩框架
  • 60%压缩率下内存减2.4倍,每秒生成数提升2倍
  • 无需修改模型,适配现有视觉语言模型

视觉语言模型(VLMs)作为大语言模型的多模态延伸,通过文本与图像输入实现跨模态推理。然而,自回归解码中庞大的键值(KV)缓存带来显著内存开销,尤其在处理图像时更为严重——图像生成更长的标记序列和更密集的特征表示。此外,视觉标记的空间结构与信息丰富性导致注意力模式具有强结构性,使原有针对纯文本模型的缓存压缩方法失效。本文通过对视觉标记行为的细致分析,揭示其与纯文本模型的关键差异,并提出KVCapsule框架,专门用于视觉标记的键值缓存压缩。该框架保持预训练模型不变,不修改注意力计算模块,仅通过轻量级压缩与重建组件即可集成至现有VLM中。在多个主流VLM与基准任务上评估显示,在60%压缩率下,内存占用减少2.4倍,每秒生成数(TPS)提升2倍,且准确率与响应质量几乎无损。研究结果为受限内存下的VLM推理扩展提供了实用路径,并推动面向多模态模型的结构感知缓存压缩研究。

原文摘要 · Abstract (English)

Vision-Language Models (VLMs) have emerged as a critical and fast-growing extension of Large Language Models (LLMs) that enable multimodal reasoning through both text and image inputs. Although VLMs enrich the capabilities of language models, they also inherit and amplify key computational bottlenecks: the memory overhead caused by the large key-value (KV) cache during autoregressive decoding. This challenge is particularly severe in VLMs, where images produce longer token sequences and denser feature representations compared to text. Moreover, the spatial and information-rich nature of vision tokens introduces structured attention patterns that make many LLM-oriented KV cache compression techniques ineffective when applied directly to VLMs. In this work, we conduct a detailed empirical analysis of the behavior of vision tokens, highlighting the critical differences from purely text-based models. Based on these insights, we propose KVCapsule, a novel KV cache compression framework for vision tokens. KVCapsule keeps the pretrained VLM backbone frozen, requires no modification to the attention computation modules, and can be integrated into existing VLMs through lightweight compression and reconstruction components. We evaluate KVCapsule on multiple VLMs and benchmark tasks, demonstrating up to 2x improvement in TPS and 2.4x reduction in KV cache memory at a 60% compression ratio, with negligible degradation in accuracy or response quality. Our findings offer practical pathways to scale VLM inference under constrained memory budgets and inspire further research into structure-aware cache compression for multimodal models.

视觉语言模型键值缓存压缩推理加速

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