通过旋转对齐通道重要性,实现高效视觉语言模型推理。
Rotation-Aligned Key Channel Pruning for Efficient Vision-Language Model Inference

- 用在线PCA旋转对齐通道重要性,实现轻量头级掩码剪枝。
- 在相同缓存预算下,准确率提升且解码延迟更低。
- 适合需要高效推理的视觉语言模型部署场景。
视觉语言模型在推理时面临严重的键值缓存压力,单张图像常生成数千个标记。现有方法多通过标记剪枝利用标记稀疏性,但永久丢弃视觉内容会显著损害细粒度感知任务性能。为此,我们提出特征稀疏性这一互补路径:在固定键值缓存预算下,压缩通道维度可在相同内存成本下保留更多视觉标记。然而,先前的键通道剪枝方法存在结构权衡:逐标记剪枝表达性强但无结构且慢,逐头剪枝硬件友好但鲁棒性差。我们提出RotateK,一种基于旋转的结构化键通道剪枝框架。RotateK采用在线PCA旋转,将依赖标记的通道重要性对齐至共享低维子空间,支持轻量级头级掩码进行精确剪枝;同时使用融合Triton注意力核直接在稀疏通道键上操作,实现高效解码。在两种代表性视觉语言模型主干网络上的实验表明,RotateK在准确率和解码延迟上均优于先前键通道剪枝方法,联合标记-通道剪枝在匹配的键值缓存预算下优于仅标记剪枝基线。
原文摘要 · Abstract (English)
Vision-Language Models suffer severe KV cache pressure at inference, as a single image often encodes into thousands of tokens. Most existing methods exploit token sparsity through token pruning, but permanently discarding visual content causes substantial degradation on fine-grained perception tasks. This motivates a complementary axis, feature sparsity: under a fixed KV cache budget, compressing the channel dimension preserves more visual tokens at the same memory cost. Prior Key channel pruning methods, however, face a structural trade-off: token-wise channel pruning is expressive but unstructured and slow, while head-wise approach is hardware-friendly but less robust. We resolve this with RotateK, a rotation-based structured Key channel pruning framework. RotateK applies an online PCA-based rotation that aligns token-dependent channel importance into a shared low-dimensional subspace, enabling accurate pruning under lightweight head-wise masks; a fused Triton attention kernel operates directly on sparse-channel Keys for efficient decoding. Experiments on two representative VLM backbones show that RotateK consistently outperforms prior Key channel pruning in both accuracy and decoding latency, while joint token-channel pruning improves over token-only baselines at matched KV cache budgets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。