arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.20439cs.CVcs.AI
收藏

面向视觉语言模型的以对象为中心的视觉令牌剪枝

Object-Centric Vision Token Pruning for Vision Language Models

Aalto University(阿alto大学);University of Electronic Science and Technology of China(电子科学与技术大学);Delft University of Technology(代尔夫特理工大学)

Guangyuan Li, Rongzhen Zhao, Jinhong Deng, Yanbo Wang, Joni Pajarinen

AI总结:

提出OC-VTP方法,通过轻量预训练以对象为中心的视觉令牌剪枝器,直接选择最具代表性的视觉令牌,在保持高精度的同时提升VLM推理效率。

摘要:

在视觉语言模型(VLM)中,与语言令牌相比,视觉令牌数量庞大但信息分散,因此消耗了大量不必要的计算。为了提升VLM推理效率,剪枝冗余视觉令牌的研究一直在进行,但现有方法都采用间接且无保证的方式。我们提出了OC-VTP,一种直接且有保证的方法,用于选择最具代表性的视觉令牌,以实现高效且保持精度的VLM推理。我们的OC-VTP仅需对一个小型的以对象为中心的视觉令牌剪枝器进行轻量预训练,然后即可将其插入现有VLM中,无需在任何数据集上微调任何模型。通过最小化从所选令牌重建原始未剪枝令牌的误差,保证保留最具代表性的视觉令牌。在任何视觉剪枝比例(即推理效率)下,我们的OC-VTP都能一致地帮助主流VLM保持最高的推理精度。我们的剪枝还展示了有趣的可解释性。我们的代码可在 https://github.com/GarryLarry010131/OC-VTP 获取。

英文摘要:

In Vision Language Models (VLMs), vision tokens are quantity-heavy yet information-dispersed compared with language tokens, thus consume too much unnecessary computation. Pruning redundant vision tokens for high VLM inference efficiency has been continuously studied but all existing methods resort to indirect and non-guaranteed ways. We propose OC-VTP, a direct and guaranteed approach to select the most representative vision tokens for high-efficiency yet accuracy-preserving VLM inference. Our OC-VTP requires merely light-weight pre-training of a small object-centric vision token pruner, which can then be inserted into existing VLMs, without fine-tuning of any models on any datasets. It is gauranteed that the most representative vision tokens are kept by minimizing the error in reconstructing the original unpruned tokens from the selected ones. Across any vision pruning ratios, i.e., inference efficiency, our OC-VTP consistently helps mainstream VLMs to preserve the highest inference accuracy. Our pruning also demonstrates interesting interpretability. Our codes are available at https://github.com/GarryLarry010131/OC-VTP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑