Towards Lossless Ultimate Vision Token Compression for VLMs

Dehua Zheng, Mouxiao Huang, Borui Jiang, Hailin Hu, Xinghao Chen
12/9/2025
cs.CVcs.AI

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zheng2025towards,
  title  = {Towards Lossless Ultimate Vision Token Compression for VLMs},
  author = {Dehua Zheng and Mouxiao Huang and Borui Jiang and Hailin Hu and Xinghao Chen},
  year   = {2025},
  eprint = {2512.09010},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.09010v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.09010.svg)](https://codeofpaper.com/paper/2512.09010)

Discussion