English
Related papers

Related papers: Rotation-Aligned Key Channel Pruning for Efficient…

200 papers

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

Vision-Language Models (VLMs) demand substantial computational resources during inference, largely due to the extensive visual input tokens for representing visual information. Previous studies have noted that visual tokens tend to receive…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Cheng Yang , Yang Sui , Jinqi Xiao , Lingyi Huang , Yu Gong , Chendi Li , Jinghua Yan , Yu Bai , Ponnuswamy Sadayappan , Xia Hu , Bo Yuan

Deploying Vision-Language Models (VLMs) under aggressive low-bit inference remains challenging because inference cost is dominated by the long visual-token prefix during prefill and the growing KV cache during autoregressive decoding. Token…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Xinqing Li , Xin He , Xindong Zhang , Ming-Ming Cheng , Lei Zhang , Yun Liu

Large language models (LLMs) enable long-context tasks but face efficiency challenges due to the growing key-value (KV) cache. We propose LeanK, a learning-based method that prunes unimportant key (K) cache channels by leveraging static…

Machine Learning · Computer Science 2025-08-05 Yike Zhang , Zhiyuan He , Huiqiang Jiang , Chengruidong Zhang , Yuqing Yang , Jianyong Wang , Lili Qiu

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

KV cache pruning has emerged as a promising technique for reducing memory and computation costs in long-context auto-regressive generation. Existing methods for vision-language models (VLMs) typically rely on self-attention scores from…

Computer Vision and Pattern Recognition · Computer Science 2024-12-09 Xiaohuan Pei , Tao Huang , Chang Xu

Despite the strong performance of Transformers, their quadratic computation complexity presents challenges in applying them to vision tasks. Automatic pruning is one of effective methods for reducing computation complexity without heuristic…

Computer Vision and Pattern Recognition · Computer Science 2024-06-03 Eunho Lee , Youngbae Hwang

Despite achieving remarkable performance on various vision-language tasks, Transformer-based Vision-Language Models (VLMs) suffer from redundancy in inputs and parameters, significantly hampering their efficiency in real-world applications.…

Computation and Language · Computer Science 2024-02-27 Zekun Wang , Jingchang Chen , Wangchunshu Zhou , Haichao Zhu , Jiafeng Liang , Liping Shan , Ming Liu , Dongliang Xu , Qing Yang , Bing Qin

Vision-language models (VLMs) typically encode substantially more visual tokens than text tokens, resulting in significant token redundancy. Pruning uninformative visual tokens is therefore crucial for improving computational efficiency,…

Computer Vision and Pattern Recognition · Computer Science 2026-01-19 Kai Zhao , Wubang Yuan , Yuchen Lin , Liting Ruan , Xiaofeng Lu , Deng-Ping Fan , Ming-Ming Cheng , Dan Zeng

Since the introduction of the Vision Transformer (ViT), researchers have sought to make ViTs more efficient by removing redundant information in the processed tokens. While different methods have been explored to achieve this goal, we still…

Computer Vision and Pattern Recognition · Computer Science 2023-08-10 Joakim Bruslund Haurum , Sergio Escalera , Graham W. Taylor , Thomas B. Moeslund

Multimodal Large Language Models face severe challenges in computational efficiency and memory consumption due to the substantial expansion of the visual KV cache when processing long visual contexts. Existing KV cache compression methods…

Machine Learning · Computer Science 2026-05-07 Sihao Liu , YuFan Xiong , Zhonghua Jiang , Zhaode Wang , chengfei lv Shengyu Zhang

Vision Transformers (ViTs) have achieved state-of-the-art performance across various computer vision tasks, but their high computational cost remains a challenge. Token pruning has been proposed to reduce this cost by selectively removing…

Sound · Computer Science 2025-10-27 Taehan Lee , Hyukjun Lee

DeepSeek-OCR leverages visual-text compression to reduce long-text processing costs and accelerate inference, yet visual tokens remain prone to redundant textual and structural information. Moreover, current token pruning methods for…

Computer Vision and Pattern Recognition · Computer Science 2026-05-22 Ben Wan , Yan Feng , Zihan Tang , Weizhe Huang , Yuting Zeng , Jia Wang , Tongxuan Liu

Long-context inference in large language models (LLMs) is increasingly constrained by the KV cache bottleneck: memory usage grows linearly with sequence length, while attention computation scales quadratically. Existing approaches address…

Computation and Language · Computer Science 2025-11-13 Huanxuan Liao , Yixing Xu , Shizhu He , Guanchen Li , Xuanwu Yin , Dong Li , Emad Barsoum , Jun Zhao , Kang Liu

Visual token reduction lowers inference costs caused by extensive image features in large vision-language models (LVLMs). Unlike relevant studies that prune tokens in self-attention-only LVLMs, our work uniquely addresses…

Computer Vision and Pattern Recognition · Computer Science 2025-04-02 Jewon Lee , Ki-Ung Song , Seungmin Yang , Donguk Lim , Jaeyeon Kim , Wooksu Shin , Bo-Kyeong Kim , Yong Jae Lee , Tae-Ho Kim

State Space Models (SSMs) have the advantage of keeping linear computational complexity compared to attention modules in transformers, and have been applied to vision tasks as a new type of powerful vision foundation model. Inspired by the…

Computer Vision and Pattern Recognition · Computer Science 2024-09-30 Zheng Zhan , Zhenglun Kong , Yifan Gong , Yushu Wu , Zichong Meng , Hangyu Zheng , Xuan Shen , Stratis Ioannidis , Wei Niu , Pu Zhao , Yanzhi Wang

Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Junzhu Mao , Yang Shen , Jinyang Guo , Yazhou Yao , Xiansheng Hua

Vision Transformers (ViTs) have emerged as the backbone of many segmentation models, consistently achieving state-of-the-art (SOTA) performance. However, their success comes at a significant computational cost. Image token pruning is one of…

Computer Vision and Pattern Recognition · Computer Science 2024-12-02 Hanning Chen , Yang Ni , Wenjun Huang , Yezi Liu , SungHeon Jeong , Fei Wen , Nathaniel Bastian , Hugo Latapie , Mohsen Imani

Large Multimodal Models (LMMs) excel in visual-language tasks by leveraging numerous visual tokens for fine-grained visual information, but this token redundancy results in significant computational costs. Previous research aimed at…

Computer Vision and Pattern Recognition · Computer Science 2025-09-12 Sihan Yang , Runsen Xu , Chenhang Cui , Tai Wang , Dahua Lin , Jiangmiao Pang

Large Vision-Language Models (LVLMs) incur high computational costs due to significant redundancy in their visual tokens. To effectively reduce this cost, researchers have proposed various visual token pruning methods. However, existing…

Computer Vision and Pattern Recognition · Computer Science 2026-01-27 Wen Luo , Peng Chen , Xiaotao Huang , LiQun Huang
‹ Prev 1 2 3 10 Next ›