RoRA is a training-free framework that casts visual token pruning as role-oriented regional evidence allocation, and consistently outperforms strong training-free baselines across LLaVA and Qwen-VL families, retaining most of the unpruned accuracy even at aggressive pruning ratios.
Abstract
Multimodal large language models (MLLMs) encode images as long visual token sequences, making prefilling and KV-cache storage expensive. Existing training-free pruning methods select tokens by importance, diversity, or spatial coverage, but treat retained tokens as interchangeable and do not explicitly track which object-related regions are already covered. We present RoRA, a training-free framework that casts visual token pruning as role-oriented regional evidence allocation. Given a fixed budget, RoRA partitions tokens into a protected semantic core, complementary context, and fine-grained detail. It first calibrates text-conditioned attention with a positional prior and a prompt-calibrated object prior, then builds Attention-Anchored Regions (AARs) from high-confidence anchors as lightweight proxies for covered object support. Context is explored mainly outside AARs, while a small AAR-guided budget restores local detail; pairwise similarity is used only for context-stage redundancy filtering. Under matched budgets, RoRA consistently outperforms strong training-free baselines across LLaVA and Qwen-VL families, retaining most of the unpruned accuracy even at aggressive pruning ratios, e.g., 96.5% of full performance at 88.9% pruning on LLaVA-1.5, and improving over D2Pruner by about 5% on Qwen3-VL at 75-90% pruning. At a 66.7% pruning ratio, RoRA requires only 0.7 ms for token selection and reduces end-to-end inference time by 24.6%, corresponding to a 1.33x speedup over unpruned inference on an NVIDIA H800.
Visual token pruning reduces the inference cost of multimodal large language models, but a fixed token ratio is poorly matched to text-rich inputs. In OCR-centric tasks, decisive evidence can be a small number, label, or field whose relevance is specified by the question; indiscriminate pruning can erase that evidence...
Zizhong Ding, Junxian Li, Kai Liu et al.· 0 citations
This work proposes Single-Forward Pruner (SFPruner), a structural reformulation of visual token pruning that embeds redundancy control directly into the scoring space, bypassing the need for iterative combinatorial optimization and achieves redundancy-aware importance selection in a single forward pass.
J. Song, Woohyeong Kim, Kyeongbo Kong· arXiv.org· 0 citations
This work introduces RUTA, a principled Rate-Utility Token Allocation method that performs pre-LLM reduction by jointly learning which tokens to retain and how many to allocate to each image-query pair, and is optimized with a penalized rate-utility objective that balances downstream task loss against expected token us...
Jiangyu Zou, Xiaoyu Xu, Zhihua Wang et al.· 0 citations
PAQ (Prompt-Grounded Attention Quality), a metric quantifying how well each head aligns the prompt with image regions, is proposed and built on, which delivers state-of-the-art trade-offs on LLaVA-1.5-7B.
Yuan Sun, Hua-Wei Ji, Yuanhao Jin et al.· 1 citation
This work proposes Greedy Orthogonal Token Selection (GOTS), a training-free and query-agnostic method that achieves higher average performance retention than the strongest evaluated baselines, and a controlled OCRBench study shows that it reduces model-side time-to-first-token after accounting for selection overhead.
Jun Ling, Tao Huang, Junzhuo Liu et al.· arXiv.org· 0 citations
The results show that structured coordinate generation provides an effective approach to generative visual grounding and Hi-Token encodes each coordinate with axis-specific tokens for the hundreds, tens, and ones digits, which adds coarse-to-fine structure and increases token reuse while retaining the existing VLM arch...
Xiuyuan Zhu, Ke Lu, Kun Dong 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.