提出无损视觉令牌压缩框架,显著提升多模态模型推理速度。
Towards Lossless Ultimate Vision Token Compression for VLMs
- 通过迭代合并与频谱剪枝,无损压缩视觉令牌
- 推理速度提升2倍,精度损失可忽略
- 无需训练,适配多种多模态模型
视觉语言模型在计算效率和延迟方面面临挑战,主要源于高分辨率图像和视频中令牌表示的大量冗余。现有基于注意力/相似性的压缩算法存在位置偏差或类别不平衡问题,导致精度显著下降,且难以泛化至浅层LLM(弱跨模态交互)。为此,我们通过空间轴正交的迭代合并方案扩展了视觉编码器的令牌压缩,加速整个VLM的计算。同时,在LLM中引入无注意力/相似性低通滤波频谱剪枝单元,逐步剔除冗余视觉令牌,完全兼容现代FlashAttention。在此基础上,提出无损终极视觉令牌压缩(LUVC)框架。该框架系统性地将视觉令牌压缩至最终层完全消除,使高维视觉特征逐步融入多模态查询。实验表明,LUVC在语言模型中实现2倍推理加速,精度损失微乎其微,且无需训练,可立即部署于多个VLM。
原文摘要 · Abstract (English)
Visual language models encounter challenges in computational efficiency and latency, primarily due to the substantial redundancy in the token representations of high-resolution images and videos. Current attention/similarity-based compression algorithms suffer from either position bias or class imbalance, leading to significant accuracy degradation. They also fail to generalize to shallow LLM layers, which exhibit weaker cross-modal interactions. To address this, we extend token compression to the visual encoder through an effective iterative merging scheme that is orthogonal in spatial axes to accelerate the computation across the entire VLM. Furthermoer, we integrate a spectrum pruning unit into LLM through an attention/similarity-free low-pass filter, which gradually prunes redundant visual tokens and is fully compatible to modern FlashAttention. On this basis, we propose Lossless Ultimate Vision tokens Compression (LUVC) framework. LUVC systematically compresses visual tokens until complete elimination at the final layer of LLM, so that the high-dimensional visual features are gradually fused into the multimodal queries. The experiments show that LUVC achieves a 2 speedup inference in language model with negligible accuracy degradation, and the training-free characteristic enables immediate deployment across multiple VLMs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。