Skip to content
Preprint

QCPruner: Query-Conditioned Population Coverage for Visual Token Pruning

Sep 2026 · 2 citations · 36 references
Computer Science

TL;DR

QCPruner fuses two cross-modal cues into utility and applies it to both visual targets and candidate representatives within visual-affinity-based coverage, which achieves the highest average relative performance among evaluated complete-system pruning methods at every reported token budget.

Abstract

The high visual-token load in multimodal large language models (MLLMs) motivates training-free pruning to reduce later-layer computation, but under a fixed budget, pruning must preserve query-relevant evidence while avoiding redundancy. Existing methods rank tokens, diversify selected subsets, or optimize coverage without using a shared per-visual query utility to weight both visual targets and candidate representatives. We introduce QCPruner, which makes both roles query-conditioned through bilateral utility weighting. Using keyword-matched query anchors, QCPruner fuses two cross-modal cues into utility and applies it to both visual targets and candidate representatives within visual-affinity-based coverage. The resulting nonnegative facility-location objective is monotone and submodular, retains the standard (1-1/e) greedy guarantee, and requires no model training or parameter updates. Across LLaVA-1.5, LLaVA-NeXT, LLaVA-Video, and Qwen2.5-VL, QCPruner achieves the highest average relative performance among evaluated complete-system pruning methods at every reported token budget. At 32 of 576 tokens on LLaVA-1.5-7B, it retains 96.1% of unpruned performance, versus 93.9% for the strongest evaluated baseline. At 256 of 1296 tokens on Qwen2.5-VL-7B, the corresponding values are 96.7% and 92.5%.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

StackTok: Accelerating VLMs Inference with Budget-Adaptive Visual Token Selection

StackTok is introduced, a training-free selector that treats query relevance as the objective and visual coverage as budget-calibrated support in vision-language models and ranks first among training-free selectors in every tested model--budget setting.

Zhen-Bin Wang, Lei Zhang, Li-Tuan Wang et al. · 0 citations
Preprint Sep 2026

From Saliency to Discriminability: Rank-Preserving Visual Token Pruning for VLM Rerankers

Large vision-language models used as listwise rerankers must jointly process visual tokens from tens of candidates per query, making token pruning essential for practical deployment. Existing pruning methods retain tokens by attention saliency, yet we show that saliency is systematically misaligned with ranking contrib...

Si-Yi Liu, Han-Jun Yang, Chen-Chen Zhang et al. · 1 citation
Preprint Oct 2026

SheafPrune: Sheaf-Guided Graph Propagation for Visual Token Pruning

Multimodal large language models process the complete visual token sequence, increasing prefill cost even when many tokens are irrelevant to the instruction. Token-wise saliency captures limited inter-token dependence; graph-based selection instead depends on how relations govern importance propagation and ranking. We...

Xiao-Yang Ma, Chi Wang, Hong Sun · 0 citations
Preprint Sep 2026

MiCo: Mutual Information Coverage Optimization through Semantic Erasure Modeling for Efficient MLLM Inference

Multimodal large language models (MLLMs) have demonstrated impressive performance in multimodal understanding, but processing large numbers of visual tokens results in high computational costs. While many methods have been proposed to reduce the number of visual tokens, most of them rely on heuristics and are prone to...

Ting-Hao Wang, Yi-Chen Guo, Qi-Zhe Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.