StreamingAssistant: Efficient Visual Token Pruning for Accelerating Online Video Understanding

Xinqi Jin, Hanxun Yu, Bohan Yu, Kebin Liu, Jian Liu +6 more
12/14/2025
cs.CVcs.AI

No confident code implementation found for this paper.

Abstract

Online video understanding is essential for applications like public surveillance and AI glasses. However, applying Multimodal Large Language Models (MLLMs) to this domain is challenging due to the large number of video frames, resulting in high GPU memory usage and computational latency. To address these challenges, we propose token pruning as a means to reduce context length while retaining critical information. Specifically, we introduce a novel redundancy metric, Maximum Similarity to Spatially Adjacent Video Tokens (MSSAVT), which accounts for both token similarity and spatial position. To mitigate the bidirectional dependency between pruning and redundancy, we further design a masked pruning strategy that ensures only mutually unadjacent tokens are pruned. We also integrate an existing temporal redundancy-based pruning method to eliminate temporal redundancy of the video modality. Experimental results on multiple online and offline video understanding benchmarks demonstrate that our method significantly improves the accuracy (i.e., by 4\% at most) while incurring a negligible pruning latency (i.e., less than 1ms). Our full implementation will be made publicly available.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jin2025streamingassistant,
  title  = {StreamingAssistant: Efficient Visual Token Pruning for Accelerating Online Video Understanding},
  author = {Xinqi Jin and Hanxun Yu and Bohan Yu and Kebin Liu and Jian Liu and Keda Tao and Yixuan Pei and Huan Wang and Fan Dang and Jiangchuan Liu and Weiqiang Wang},
  year   = {2025},
  eprint = {2512.12560},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.12560v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.12560.svg)](https://codeofpaper.com/paper/2512.12560)

Discussion