DCP-Prune: Ultra-Low Token Pruning with Distribution Consistency Preservation

Xifeng Xue, Xiaokang Wang, Zirui Li, Ming-Ming Cheng, Guolei Sun
6/15/2026
cs.CVcs.AI

No confident code implementation found for this paper.

Abstract

Recent vision token pruning methods effectively preserve model performance under moderate token budgets but become unstable under ultra-low token budget. Our analysis shows that as the pruning budget decreases, accuracy degradation is often accompanied by larger feature distribution shifts. Critically, the degree of this distribution shift strongly correlates with performance degradation. To better characterize this phenomenon, we introduce a lightweight distribution consistency metric to estimate the distribution shift between retained and full tokens. Motivated by these observations, we propose a two-stage pruning framework consisting of Anchor-Context Graph Recovery (ACGR) and Text-Aware Token Cluster Selection (TATCS). Specifically, ACGR transfers contextual information before token removal, while TATCS dynamically re-selects representative tokens when severe distribution shift is detected. Extensive experiments demonstrate that our method achieves superior and more stable performance under ultra-low token budget. Notably, it retains 92.1% of the upper-bound average performance on LLaVA-1.5-7B with only 16 visual tokens.

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{xue2026dcpprune,
  title  = {DCP-Prune: Ultra-Low Token Pruning with Distribution Consistency Preservation},
  author = {Xifeng Xue and Xiaokang Wang and Zirui Li and Ming-Ming Cheng and Guolei Sun},
  year   = {2026},
  eprint = {2606.16633},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.16633v1}
}

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/2606.16633.svg)](https://codeofpaper.com/paper/2606.16633)

Discussion