arXiv Computer Vision By Xiaoyang Ma, Chi Wang, Hong Sun

SheafPrune: Sheaf-Guided Graph Propagation for Visual Token Pruning

Read the original on arXiv Computer Vision →

SheafPrune introduces a sheaf‑guided graph propagation method for pruning visual tokens in multimodal large language models. It constructs modality‑specific maps and a sparse text‑visual graph to transfer relevance, then propagates and degree‑corrects scores on a visual graph before selecting a hard top‑k subset. Evaluated across four backbones, ten benchmarks, and seven pruning ratios, SheafPrune consistently outperforms baselines, achieving up to a 5.15× prefill speedup and 84.0% FLOPs reduction on LLaVA‑NeXT‑8B while retaining 10% of tokens.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

arXiv Computer Vision
Sep 23

From Token Importance to Conditional Removability: Rethinking Visual Token Pruning in Multimodal Large Language Models

The paper argues that token importance alone is insufficient to determine safe removal of visual tokens in multimodal large language models, because removability depends on representation depth and the surrounding deletion set. Through controlled experiments, the authors show that the same tokens can have different effects when removed at different depths or contexts. They introduce CoRePrune, a training‑free two‑stage pruning framework that refreshes deletion effects as visual representations evolve and refines candidate tokens based on the current deletion set, achieving high performance retention across multiple backbones and reducing prefill time significantly.

By Shengli He, Yongchao Liang, Roumeng He, Junjie Zeng, Jiyuan He, Xin Fang, Can Wu, Li Zheng
arXiv Computer Vision
3d ago

CatchUp: Depth-Aware Re-Admission of Visual Tokens for Efficient Large Vision-Language Models

CatchUp is a training‑free framework that improves efficiency in large vision‑language models by depth‑aware re‑admission of visual tokens. It repeatedly evaluates query‑conditioned relevance, processes only selected tokens per decoder interval, and preserves deferred tokens for later re‑admission, using reference‑to‑current transition signals to approximate missed representation evolution. Experiments on three referring‑expression grounding datasets and six multimodal benchmarks show that CatchUp retains over 92% of full‑model performance with 88.9% fewer active tokens and reduces end‑to‑end latency by 8.0% at a 64‑token budget.

By Eunju Park, Uiwon Hwang