analiza aiqbench
CoverPruner introduces a novel, training-free approach to visual token pruning by reframing the problem as representational coverage maximization rather than simple score-based retention. By ensuring discarded tokens have close representatives among the surviving set, this method significantly outperforms existing techniques in maintaining accuracy under aggressive compression across various VLM architectures. This advancement directly addresses inference efficiency bottlenecks without sacrificing model performance, offering a practical pathway for deploying lightweight vision-language models.
Who Speaks for the Pruned? Visual Token Pruning as Coverage Optimization
arXiv:2609.03158v1 Announce Type: cross Abstract: Visual token pruning reduces the inference cost of vision-language models (VLMs), but most methods only ask which tokens to keep. This retained-token view can keep redundant high-scoring tokens while leaving discarded evidence without a close representative. We propose CoverPruner, a training-free pruner that asks the complementary demand-side question: after a token is removed, which surviving original token represents it for the target VLM? CoverPruner formulates pruning as Representational Coverage Maximization (RCM), covering the full projected visual-token set with query-weighted demand. It instantiates RCM with projector-space coverage and a lightweight first-layer attention probe. Across multiple VLM architectures and compression rates, CoverPruner achieves the best average accuracy among all compared methods, with the largest gains usually appearing under aggressive compression.
Title:Who Speaks for the Pruned? Visual Token Pruning as Coverage Optimization
Abstract:Visual token pruning reduces the inference cost of vision-language models (VLMs), but most methods only ask which tokens to keep. This retained-token view can keep redundant high-scoring tokens while leaving discarded evidence without a close representative. We propose CoverPruner, a training-free pruner that asks the complementary demand-side question: after a token is removed, which surviving original token represents it for the target VLM? CoverPruner formulates pruning as Representational Coverage Maximization (RCM), covering the full projected visual-token set with query-weighted demand. It instantiates RCM with projector-space coverage and a lightweight first-layer attention probe. Across multiple VLM architectures and compression rates, CoverPruner achieves the best average accuracy among all compared methods, with the largest gains usually appearing under aggressive compression.
Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL); Machine Learning (cs.LG)
arXiv:2609.03158 [cs.CV]
(or arXiv:2609.03158v1 [cs.CV] for this version)
https://doi.org/10.48550/arXiv.2609.03158 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 233 cuvinte
Subiecte conexe
[AINews] High Taste Testers Ep. 1
Latent Space · 17 oct. 2026
TOPS: First-Principles Visual Token Pruning via Constructing Token Optimal Preservation Sets for Efficient MLLM Inference
arXiv · 24 sept. 2026

[AINews] not much happened today
Latent Space · 10 sept. 2026

Capturing token IDs during agentic interactions for better reinforcement learning
Amazon Science · 9 iul. 2026