English
Related papers

Related papers: Keyframe-oriented Vision Token Pruning: Enhancing …

200 papers

Token pruning has emerged as a mainstream approach for developing efficient Video Large Language Models (Video LLMs). This work revisits and advances the two predominant token-pruning paradigms: attention-based selection and…

Computer Vision and Pattern Recognition · Computer Science 2026-04-14 Shukang Yin , Sirui Zhao , Hanchao Wang , Baozhi Jia , Xianquan Wang , Chaoyou Fu , Enhong Chen

Large Language Models (LLMs) have revolutionized the field of natural language processing, achieving unprecedented performance across a variety of applications. However, their increased computational and memory demands present significant…

Computation and Language · Computer Science 2025-02-28 Yuhui Xu , Zhanming Jie , Hanze Dong , Lei Wang , Xudong Lu , Aojun Zhou , Amrita Saha , Caiming Xiong , Doyen Sahoo

Real-world deployment of Vision-Language Models (VLMs) is hindered by high computational demands, as existing architectures inefficiently process all tokens uniformly. We introduce Adaptive Token Pruning (ATP), a dynamic inference mechanism…

Computer Vision and Pattern Recognition · Computer Science 2025-12-16 Xue Li , Xiaonan Song , Henry Hu

The increasing demand to process long and high-resolution videos significantly burdens Large Vision-Language Models (LVLMs) due to the enormous number of visual tokens. Existing token reduction methods primarily prune tokens based on…

Computer Vision and Pattern Recognition · Computer Science 2025-07-28 Tianyu Fu , Tengxuan Liu , Qinghao Han , Guohao Dai , Shengen Yan , Huazhong Yang , Xuefei Ning , Yu Wang

Although Large Vision Language Models (LVLMs) have demonstrated impressive multimodal reasoning capabilities, their scalability and deployment are constrained by massive computational requirements. In particular, the massive amount of…

Machine Learning · Computer Science 2026-04-14 Surendra Pathak , Bo Han

Visual token pruning aims to compress and prune redundant visual tokens which play a critical role in efficient inference with large vision-language models (LVLMs). However, most existing work estimates visual redundancy using a single…

Computer Vision and Pattern Recognition · Computer Science 2025-11-20 Duo Li , Zuhao Yang , Xiaoqin Zhang , Ling Shao , Shijian Lu

Omnimodal Large Language Models (Omni-LLMs) incur substantial computational overhead due to the large number of multimodal input tokens they process, making token reduction essential for real-world deployment. Existing Omni-LLM pruning…

Computer Vision and Pattern Recognition · Computer Science 2026-05-13 Chaeyoung Jung , Kyeongha Rho , Joon Son Chung

Video Large Language Models (VLMs) have achieved strong performance on various vision-language tasks, yet their practical use is limited by the massive number of visual tokens produced from raw video frames, which quickly exhausts the…

Computer Vision and Pattern Recognition · Computer Science 2025-12-19 Guangyu Sun , Archit Singhal , Burak Uzkent , Mubarak Shah , Chen Chen , Garin Kessler

Video Large Language Models (VideoLLMs) have made significant strides in video understanding but struggle with long videos due to the limitations of their backbone LLMs. Existing solutions rely on length extrapolation, which is…

Computer Vision and Pattern Recognition · Computer Science 2025-03-25 Xiao Wang , Qingyi Si , Jianlong Wu , Shiyu Zhu , Li Cao , Liqiang Nie

Large Vision Language Models show impressive performance across image and video understanding tasks, yet their computational cost grows rapidly with the number of visual tokens. Existing token pruning methods mitigate this issue through…

Computer Vision and Pattern Recognition · Computer Science 2026-04-02 Dong-Jae Lee , Sunghyun Baek , Junmo Kim

Large Vision-Language Models (LVLMs) excel in visual understanding and reasoning, but the excessive visual tokens lead to high inference costs. Although recent token reduction methods mitigate this issue, they mainly target single-turn…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Yi Wang , Haofei Zhang , Qihan Huang , Anda Cao , Gongfan Fang , Wei Wang , Xuan Jin , Jie Song , Mingli Song , Xinchao Wang

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…

Computer Vision and Pattern Recognition · Computer Science 2026-04-14 Shaobo Ju , Baiyang Song , Tao Chen , Jiapeng Zhang , Qiong Wu , Chao Chang , HuaiXi Wang , Yiyi Zhou , Rongrong Ji

The advent of real-time large multimodal models (LMMs) like GPT-4o has sparked considerable interest in efficient LMMs. LMM frameworks typically encode visual inputs into vision tokens (continuous representations) and integrate them and…

Computer Vision and Pattern Recognition · Computer Science 2025-03-04 Shaolei Zhang , Qingkai Fang , Zhe Yang , Yang Feng

Recent progress in Multimodal Large Language Models(MLLMs) often use large image tokens to compensate the visual shortcoming of MLLMs, which not only exhibits obvious redundancy but also greatly exacerbates the already high computation.…

Computer Vision and Pattern Recognition · Computer Science 2024-12-30 Weihao Ye , Qiong Wu , Wenhao Lin , Yiyi Zhou

Large Vision-Language Models (VLMs) have been extended to understand both images and videos. Visual token compression is leveraged to reduce the considerable token length of visual inputs. To meet the needs of different tasks, existing…

Computer Vision and Pattern Recognition · Computer Science 2024-12-13 Chenyu Yang , Xuan Dong , Xizhou Zhu , Weijie Su , Jiahao Wang , Hao Tian , Zhe Chen , Wenhai Wang , Lewei Lu , Jifeng Dai

Vision-language models (VLMs) face significant computational inefficiencies caused by excessive generation of visual tokens. While prior work shows that a large fraction of visual tokens are redundant, existing compression methods struggle…

Computer Vision and Pattern Recognition · Computer Science 2026-03-12 Zhengyao Fang , Pengyuan Lyu , Chengquan Zhang , Guangming Lu , Jun Yu , Wenjie Pei

Visual token pruning reduces the computational cost of Vision-Language Models (VLMs) by removing redundant visual tokens. Existing methods typically rely on Gumbel-Softmax to approximate discrete selection during training. However, the…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Landi He , Mingde Yao , Shawn Young , Lijian Xu

Token reduction is an effective way to accelerate long-video vision-language models (VLMs), but most existing methods are designed for dense Transformers and do not directly account for hybrid architectures that interleave attention with…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Jindong Jiang , Amala Sanjay Deshmukh , Kateryna Chumachenko , Karan Sapra , Zhiding Yu , Guilin Liu , Andrew Tao , Pavlo Molchanov , Jan Kautz , Wonmin Byeon

Vision token pruning has proven to be an effective acceleration technique for the efficient Vision Language Model (VLM). However, existing pruning methods demonstrate excellent performance preservation in visual question answering (VQA) and…

Computer Vision and Pattern Recognition · Computer Science 2026-02-04 Yihong Huang , Fei Ma , Yihua Shao , Jingcai Guo , Zitong Yu , Laizhong Cui , Qi Tian

Multimodal Large Language Models (MLLMs) have demonstrated exceptional success in various multimodal tasks, yet their deployment is frequently limited by substantial computational demands and prolonged inference times. Given that the vision…

Computer Vision and Pattern Recognition · Computer Science 2025-10-01 Zihui Zhao , Yingxin Li , Yang Li