arXiv AI
StackTok: Accelerating VLMs Inference with Budget-Adaptive Visual Token Selection
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 28
GOTS: Greedy Orthogonal Token Selection for High-Resolution Vision-Language Models
arXiv:2607. 23913v1 Announce Type: new Abstract: Modern vision-language models (VLMs) increasingly rely on dynamic or high-resolution visual encoding, producing thousands of visual tokens that substantially increase downstream language-model inference cost.
arXiv AI
Jul 9
AnchorPrune: Relevance-Anchored Contextual Expansion for Visual Token Pruning
arXiv:2607. 07033v1 Announce Type: cross Abstract: Large vision-language models incur substantial inference costs because high-resolution inputs introduce thousands of visual tokens, many of which are redundant for a given query.
arXiv Computer Vision
23h ago
QCPruner: Query-Conditioned Population Coverage for Visual Token Pruning
arXiv:2609.19990v1 Announce Type: new Abstract: The high visual-token load in multimodal large language models (MLLMs) motivates training-free pruning to reduce later-layer computation, but under a f...
arXiv AI
Jun 11
AVIS: Adaptive Test-Time Scaling for Vision-Language Models
arXiv:2606. 11576v1 Announce Type: cross Abstract: Modern Vision-Language Models (VLMs) benefit from chain-of-thought prompting and test-time scaling, but these gains often come with prohibitive inference cost due to large visual contexts and long decoding chains.
arXiv Machine Learning
Sep 4
Who Speaks for the Pruned? Visual Token Pruning as Coverage Optimization
CoverPruner is a training‑free visual token pruner that reframes token pruning as a representational coverage maximization problem. Instead of selecting which tokens to keep, it asks which surviving token best represents each removed token for a vision‑language model. Experiments on various VLM architectures show that CoverPruner consistently outperforms existing methods, especially under high compression rates.
Hugging Face Trending Papers
Jul 6
Do All Visual Tokens Matter Equally? Object-Evidence Preserving Token Merging for Vision-Language Retrieval
Multi-vector vision-language retrieval preserves fine-grained visual evidence through maximum-similarity late interaction, but dense image-side tokens make storage and scoring expensive. Existing token compression methods reduce this cost, yet they can remove or collapse object- and region-level evidence that future query tokens may need to select.