Skip to content
Conference Open access

Vista-LLM: Decoupled Query-Guided Visual Token Pruning for Efficient Long-Video Large Language Models

2026 · Annual Meeting of the Association for Computational Linguistics · pp. 13171-13187 · 0 citations · 31 references
Computer Science

TL;DR

Vista-LLM is introduced, a decoupled framework for query-guided visual token pruning that reduces visual tokens by 90% and accelerates inference while retaining over 98% of baseline performance on average, effectively filtering visual noise.

Abstract

Long-video understanding is bottlenecked by the high cost of processing massive visual to-kens. Current reduction strategies often rely on static allocation or inefficient in-network selection that disrupts optimized attention kernels. In this paper, we introduce Vista-LLM, a decoupled framework for query-guided visual token pruning. By filtering redundancy prior to inference with minimal overhead, Vista-LLM ensures full compatibility with Flash Attention. Our method employs a coarse-to-fine pipeline: (1) Query-Guided Dynamic Bud-geting for adaptive temporal allocation; (2) a lightweight Semantic Scout for fine-grained, query-specific selection; and (3) Structure-Aware Compensation to preserve global context. Extensive experiments on benchmarks like Video-MME and MLVU demonstrate a significantly improved Pareto frontier. No-tably, on LLaVA-OneVision, Vista-LLM reduces visual tokens by 90% and accelerates inference while retaining over 98% of baseline performance on average, effectively filtering visual noise. Our code is available at https: //github.com/lizhenyu-123/Vista-LLM .

Read PDF

Similar papers

Preprint Sep 2026

CoFiE: Coarse-to-Fine Evidence Selection for Efficient Streaming Video Understanding

Streaming video understanding requires Vision Language Models (VLLMs) to process growing video streams and answer user questions under tight latency constraints. Existing methods improve efficiency through token pruning and memory-bank schemes, but mainly reduce visual tokens after visual encoding. Consequently, downst...

Jing-Chi Jiang, Yi-Ran Ling, Ruo-Nan Li et al. · 0 citations
Preprint Aug 2026

SlimVLM: Sensitivity-aware Dynamic Structured Pruning with Adaptive Visual Token Selection for Efficient Vision-Language Models

This work introduces an adaptive visual token selection strategy for VLMs that leverages average text-to-visual attention scores to assess the importance of visual tokens, removing redundant ones during pruning based on a set threshold, thereby optimizing the importance calculation.

Yaozhi Wen, Jialong Guo, Zhen-Liang Ni et al. · 0 citations
Preprint Aug 2026

VisCache: Visual KV Cache Pruning for Efficient Vision Large Language Model Inference

VisCache is proposed, a plug-and-play framework for coarse-to-fine KV pruning without training that consistently outperforms existing baselines, establishing a new Pareto frontier between efficiency and performance for long-context VLLM inference.

Lyuke Wang, Zhuo Li, Guang-Xu Zhu · 0 citations
Jul 2026

Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs

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 · 0 citations

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