English
Related papers

Related papers: ASAP: Attention-Shift-Aware Pruning for Efficient …

200 papers

Autoregressive Transformers adopted in Large Language Models (LLMs) are hard to scale to long sequences. Despite several works trying to reduce their computational cost, most of LLMs still adopt attention layers between all pairs of tokens…

Computation and Language · Computer Science 2024-06-03 Sotiris Anagnostidis , Dario Pavllo , Luca Biggio , Lorenzo Noci , Aurelien Lucchi , Thomas Hofmann

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

Long-context understanding is crucial for many NLP applications, yet transformers struggle with efficiency due to the quadratic complexity of self-attention. Sparse attention methods alleviate this cost but often impose static, predefined…

Computation and Language · Computer Science 2025-06-16 Hanzhi Zhang , Heng Fan , Kewei Sha , Yan Huang , Yunhe Feng

Due to the prevalence of large language models (LLMs), key-value (KV) cache reduction for LLM inference has received remarkable attention. Among numerous works that have been proposed in recent years, layer-wise token pruning approaches,…

Computation and Language · Computer Science 2026-04-17 Rei Taniguchi , Yuyang Dong , Makoto Onizuka , Chuan Xiao

Large language models (LLMs) now support context windows of hundreds of thousands to millions of tokens, enabling applications such as long-document summarization, large-scale code synthesis, multi-document question answering and persistent…

Computation and Language · Computer Science 2025-10-22 Siyuan Yan , Guo-Qing Jiang , Yuchen Zhang , Xiaoxing Ma , Ran Zhu , Chun Cao , Jingwei Xu

Audio-Visual Speech Recognition (AVSR) achieves robust speech recognition in noisy environments by combining auditory and visual information. However, recent Large Language Model (LLM) based AVSR systems incur high computational costs due…

Computer Vision and Pattern Recognition · Computer Science 2025-06-06 Jeong Hun Yeo , Hyeongseop Rha , Se Jin Park , Yong Man Ro

Pruning is a highly effective approach for compressing large language models (LLMs), significantly reducing inference latency. However, conventional training-free structured pruning methods often employ a heuristic metric that…

Computation and Language · Computer Science 2026-01-28 Songtao Liu , Peng Liu

Despite their powerful capabilities, Multimodal Large Language Models (MLLMs) suffer from considerable computational overhead due to their reliance on massive visual tokens. Recent studies have explored token pruning to alleviate this…

Computer Vision and Pattern Recognition · Computer Science 2025-10-13 Xin Zou , Di Lu , Yizhou Wang , Yibo Yan , Yuanhuiyi Lyu , Xu Zheng , Linfeng Zhang , Xuming Hu

Vision-Language Models (VLMs) have revolutionized multi-modal learning by jointly processing visual and textual information. Yet, they face significant challenges due to the high computational and memory demands of processing long sequences…

Computer Vision and Pattern Recognition · Computer Science 2026-05-21 Yvon Apedo , Martyna Poreba , Michal Szczepanski , Samia Bouchafa

Recent advances have explored visual token pruning to accelerate the inference of large vision-language models (LVLMs). However, existing methods often struggle to balance token importance and diversity: importance-based methods tend to…

Computer Vision and Pattern Recognition · Computer Science 2026-04-08 Zhaohong Huang , Wenjing Liu , Yuxin Zhang , Fei Chao , Rongrong Ji

Large Vision-Language Models (LVLMs) rely on dense visual tokens to capture fine-grained visual information, but processing all these tokens incurs substantial computational and memory overhead during inference. To address this issue, we…

Machine Learning · Computer Science 2026-03-24 Xu Li , Yi Zheng , Yuxuan Liang , Zhe Liu , Xiaolei Chen , Haotian Chen , Rui Zhu , Xiangyang Xue

Modern large vision-language models (LVLMs) convert each input image into a large set of tokens that far outnumber the text tokens. Although this improves visual perception, it also introduces severe image token redundancy. Because image…

Computer Vision and Pattern Recognition · Computer Science 2025-12-10 Yanshu Li , Jianjiang Yang , Zhennan Shen , Ligong Han , Haoyan Xu , Ruixiang Tang

Vision-Language Models (VLMs) have achieved remarkable progress in multimodal reasoning and generation, yet their high computational demands remain a major challenge. Diffusion Vision-Language Models (DVLMs) are particularly attractive…

Computer Vision and Pattern Recognition · Computer Science 2025-11-18 Jingqi Xu , Jingxi Lu , Chenghao Li , Sreetama Sarkar , Souvik Kundu , Peter A. Beerel

Multimodal Large Language Models (MLLMs) suffer from substantial computational overhead due to the high redundancy in visual token sequences. Existing approaches typically address this issue using single-layer Vision Transformer (ViT)…

Computer Vision and Pattern Recognition · Computer Science 2026-04-15 Yunkai Dang , Yizhu Jiang , Yifan Jiang , Qi Fan , Yinghuan Shi , Wenbin Li , Yang Gao

Data-efficient learning aims to eliminate redundancy in large training datasets by training models on smaller subsets of the most informative examples. While data selection has been extensively explored for vision models and large language…

Computer Vision and Pattern Recognition · Computer Science 2025-10-03 Nilay Naharas , Dang Nguyen , Nesihan Bulut , Mohammadhossein Bateni , Vahab Mirrokni , Baharan Mirzasoleiman

Vision language models (VLMs) demonstrate strong capabilities in jointly processing visual and textual data. However, they often incur substantial computational overhead due to redundant visual information, particularly in long-form video…

Machine Learning · Computer Science 2025-04-25 Yudong Liu , Jingwei Sun , Yueqian Lin , Jingyang Zhang , Ming Yin , Qinsi Wang , Jianyi Zhang , Hai Li , Yiran Chen

In vision-language models (VLMs), visual tokens usually bear a significant amount of computational overhead despite sparsity of information in them when compared to text tokens. To address this, most existing methods learn a network to…

Computer Vision and Pattern Recognition · Computer Science 2025-06-04 Yuan Zhang , Chun-Kai Fan , Junpeng Ma , Wenzhao Zheng , Tao Huang , Kuan Cheng , Denis Gudovskiy , Tomoyuki Okuno , Yohei Nakata , Kurt Keutzer , Shanghang Zhang

Large Vision-Language Models (LVLMs) have shown impressive performance across multi-modal tasks by encoding images into thousands of tokens. However, the large number of image tokens results in significant computational overhead, and the…

Computer Vision and Pattern Recognition · Computer Science 2025-10-24 Kaiyuan Li , Xiaoyue Chen , Chen Gao , Yong Li , Xinlei Chen

The computational expense of redundant vision tokens in Large Vision-Language Models (LVLMs) has led many existing methods to compress them via a vision projector. However, this compression may lose visual information that is crucial for…

Computer Vision and Pattern Recognition · Computer Science 2025-11-27 Ze Feng , Jiang-jiang Liu , Sen Yang , Lingyu Xiao , Zhibin Quan , Zhenhua Feng , Wankou Yang , Jingdong Wang

In multimodal large language models (MLLMs), the surge of visual tokens significantly increases the inference time and computational overhead, making them impractical for real-time or resource-constrained applications. Visual token pruning…

Computer Vision and Pattern Recognition · Computer Science 2026-04-10 Qihui Zhu , Tao Zhang , Yuchen Wang , Zijian Wen , Mengjie Zhang , Shuangwu Chen , Xiaobin Tan , Jian Yang , Yang Liu , Zhenhua Dong , Xianzhi Yu , Yinfei Pan