English

TTF: Temporal Token Fusion for Efficient Video-Language Model

Computer Vision and Pattern Recognition 2026-05-11 v1 Artificial Intelligence

Abstract

Video-language models (VLMs) face rapid inference costs as visual token counts scale with video length. For example, 32 frames at 448×448448{\times}448 resolution already yield >8,000 visual tokens in Qwen3-VL, making LLM prefill the dominant throughput bottleneck. Existing methods often rely on global similarity or attention-guided compression, incurring offsets to their gains. We propose \textbf{Temporal Token Fusion (TTF)}, a training-free, plug-and-play pre-LLM token compression framework that exploits structured temporal redundancy in video. TTF automatically selects an anchor frame, then for each subsequent frame, performs a local window similarity search (e.g.,3×33\times 3), fusing tokens that exceed a threshold. The compressed sequence maintains positional consistency across both prefill and decoding through coordinate realignment, enabling seamless integration with existing VLM pipelines. On Qwen3-VL-8B with threshold t=0.70, TTF removes about 67\% of visual tokens while retaining 99.5\% of the baseline accuracy and introducing only 0.16{\approx}0.16\,GFLOPs of matching overhead. Overall, TTF offers a practical, efficient solution for video understanding. The code is available at \href{https://github.com/Cominder/ttf}{https://github.com/Cominder/ttf}

Keywords

Cite

@article{arxiv.2605.07355,
  title  = {TTF: Temporal Token Fusion for Efficient Video-Language Model},
  author = {Simin Huo and Ning LI},
  journal= {arXiv preprint arXiv:2605.07355},
  year   = {2026}
}

Comments

14 pages; manuscript submitted to NeurIPS 2026

R2 v1 2026-07-01T12:57:05.240Z