paper-with-me

홈 › Papers

EarlyTom: Early Token Compression Completes Fast Video Understanding

2026-05-28 · Hesong Wang, Xin Jin, Lu Lu, Chenhaowen Li, Jian Chen, Qiang Liu, Huan Wang arxiv

Video large language models (Video-LLMs) have demonstrated strong capabilities in video understanding tasks. However, their practical deployment is still hindered by the inefficiency introduced by processing massive amounts of visual tokens. Although recent approaches achieve extremely low token retention ratios while maintaining accuracy comparable to full-token baselines, most of them perform compression only at the late stage of prefilling, leaving the efficiency of the vision encoder unoptimized. In this paper, we first show that vision encoding contributes a large portion to the time-to-first-token (TTFT). Therefore, instead of compressing visual tokens only after the vision encoder, performing compression inside the encoder still leaves substantial room for exploration. Based on this insight, we propose EarlyTom, a training-free token compression framework that performs early-stage visual token compression inside the vision encoder, enabling significantly better TTFT reduction and higher throughput. In addition, we introduce a decoupled spatial token selection strategy that improves the overall compression effectiveness. EarlyTom reduces TTFT by up to 2.65x and FLOPs by up to 61% on a single NVIDIA A100 GPU for the LLaVA-OneVision-7B model, while maintaining accuracy comparable to the full-token baseline. These improvements substantially enhance the practicality of deploying Video-LLMs in real-world production scenarios.

📄 PDF Abstract BibTeX arXiv:2605.30010

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

SpiralFovea: Input-Adaptive Foveated Tokenization as a Third Lever of Resource-Adaptive Inference

2026-07-01 · Kyan Mahajan, Mohammad Saqlain arxiv

Most adaptive-inference techniques for foundation models change what the model does - early exit, MoE routing, KV-cache compression, dynamic attention sparsity. The input that hits the backbone, however, remains a fixed-…

FastKV: KV Cache Compression for Fast Long-Context Processing with Token-Selective Propagation

2025-02-03 · Dongwon Jo, Jiwon Song, Yulhwa Kim, Jae-Joon Kim

While large language models (LLMs) excel at handling long-context sequences, they require substantial key-value (KV) caches to store contextual information, which can heavily burden computational efficiency and memory us…

Computational Efficiency

Make Your ViT-based Multi-view 3D Detectors Faster via Token Compression

2024-09-01 · Dingyuan Zhang, Dingkang Liang, Zichang Tan, Xiaoqing Ye 외

Slow inference speed is one of the most crucial concerns for deploying multi-view 3D detectors to tasks with high real-time requirements like autonomous driving. Although many sparse query-based methods have already atte…

Autonomous Driving

Multi-word Tokenization for Sequence Compression

2024-02-15 · Leonidas Gee, Leonardo Rigutini, Marco Ernandes, Andrea Zugarini

Large Language Models have proven highly successful at modelling a variety of tasks. However, this comes at a steep computational cost that hinders wider industrial uptake. In this paper, we present MWT: a Multi-Word Tok…

SABlock: Semantic-Aware KV Cache Eviction with Adaptive Compression Block Size

2025-10-26 · Jinhan Chen, Jianchun Liu, Hongli Xu, Xianjun Gao 외 arxiv

The growing memory footprint of the Key-Value (KV) cache poses a severe scalability bottleneck for long-context Large Language Model (LLM) inference. While KV cache eviction has emerged as an effective solution by discar…

Semantic Segmentation