paper-with-me

홈 › Papers

ForestPrune: High-ratio Visual Token Compression for Video Multimodal Large Language Models via Spatial-Temporal Forest Modeling

2026-03-24 · Shaobo Ju, Baiyang Song, Tao Chen, Jiapeng Zhang, Qiong Wu, Chao Chang, HuaiXi Wang, Yiyi Zhou, Rongrong Ji arxiv

Due to the great saving of computation and memory overhead, token compression has become a research hot-spot for MLLMs and achieved remarkable progress in image-language tasks. However, for the video, existing methods still fall short of high-ratio token compression. We attribute this shortcoming to the insufficient modeling of temporal and continual video content, and propose a novel and training-free token pruning method for video MLLMs, termed ForestPrune, which achieves effective and high-ratio pruning via Spatial-temporal Forest Modeling. In practice, ForestPrune construct token forests across video frames based on the semantic, spatial and temporal constraints, making an overall comprehension of videos. Afterwards, ForestPrune evaluates the importance of token trees and nodes based on tree depth and node roles, thereby obtaining a globally optimal pruning decision. To validate ForestPrune, we apply it to two representative video MLLMs, namely LLaVA-Video and LLaVA-OneVision, and conduct extensive experiments on a bunch of video benchmarks. The experimental results not only show the great effectiveness for video MLLMs, e.g., retaining 95.8% average accuracy while reducing 90% tokens for LLaVA-OneVision, but also show its superior performance and efficiency than the compared token compression methods, e.g., +10.1% accuracy on MLVU and -81.4% pruning time than FrameFusion on LLaVA-Video.

📄 PDF Abstract BibTeX arXiv:2603.22911

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

ForestPrune: Compact Depth-Controlled Tree Ensembles

2022-05-31 · Brian Liu, Rahul Mazumder

Tree ensembles are powerful models that achieve excellent predictive performances, but can grow to unwieldy sizes. These ensembles are often post-processed (pruned) to reduce memory footprint and improve interpretability…

WeTok: Powerful Discrete Tokenization for High-Fidelity Visual Reconstruction

2025-08-07 · Shaobin Zhuang, Yiwei Guo, Canmiao Fu, Zhipeng Huang 외 arxiv

Visual tokenizer is a critical component for vision generation. However, the existing tokenizers often face unsatisfactory trade-off between compression ratios and reconstruction fidelity. To fill this gap, we introduce …

VisCo: Leveraging Large Language Models as Intrinsic Encoders for Visual Token Compression

2026-07-14 · Yupeng Zheng, Kai Zou, Bin Liu, Nenghai Yu arxiv

Vision-language models (VLMs) process large numbers of visual tokens, resulting in substantial inference latency and memory overhead. This has motivated extensive research on visual token compression. While training-free…

Inference Optimal VLMs Need Fewer Visual Tokens and More Parameters

2024-11-05 · Kevin Y. Li, Sachin Goyal, Joao D. Semedo, J. Zico Kolter

Vision Language Models (VLMs) have demonstrated strong capabilities across various visual understanding and reasoning tasks, driven by incorporating image representations into the token inputs of Large Language Models (L…

Token ReductionVisual Reasoning

EarlyTom: Early Token Compression Completes Fast Video Understanding

2026-05-28 · Hesong Wang, Xin Jin, Lu Lu, Chenhaowen Li 외 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 amou…