Efficient Video Sampling: Pruning Temporally Redundant Tokens for Faster VLM Inference

Natan Bagrov, Eugene Khvedchenia, Borys Tymchenko, Shay Aharon, Lior Kadoch +7 more
10/16/2025
cs.CV

No confident code implementation found for this paper.

Abstract

Vision-language models (VLMs) have recently expanded from static image understanding to video reasoning, but their scalability is fundamentally limited by the quadratic cost of processing dense frame sequences. Long videos often exceed the token budget of modern language models, leading to severe context limitations and latency issues. We introduce Efficient Video Sampling (EVS), a simple, plug-and-play method for reducing token redundancy in videos by identifying and pruning temporally static patches -- spatial regions that remain unchanged across consecutive frames. EVS preserves positional identity, requires no architectural changes or retraining. We show that EVS substantially reduces token count while maintaining semantic fidelity, enabling faster inference and longer input sequences. Applied at inference time, EVS reduces large language model (LLM) time-to-first-token (TTFT) by up to 4x with minimal accuracy loss. When combined with an uptraining phase using stochastic pruning rates, EVS yields models that are robust to varying compression levels and retain full performance under aggressive pruning. Extensive experiments demonstrate that EVS consistently improves efficiency-accuracy trade-offs, unlocking scalable video-language understanding without sacrificing quality.

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!

Cite this paper

@article{bagrov2025efficient,
  title  = {Efficient Video Sampling: Pruning Temporally Redundant Tokens for Faster VLM Inference},
  author = {Natan Bagrov and Eugene Khvedchenia and Borys Tymchenko and Shay Aharon and Lior Kadoch and Tomer Keren and Ofri Masad and Yonatan Geifman and Ran Zilberstein and Tuomas Rintamaki and Matthieu Le and Andrew Tao},
  year   = {2025},
  eprint = {2510.14624},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.14624v1}
}

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/2510.14624.svg)](https://codeofpaper.com/paper/2510.14624)

Discussion