English
Related papers

Related papers: Stop Looking for Important Tokens in Multimodal La…

200 papers

We tackle the challenge of detecting multiple change points in large time series by optimising a penalised likelihood derived from exponential family models. Dynamic programming algorithms can solve this task exactly with at most quadratic…

Methodology · Statistics 2025-07-14 Vincent Runge , Charles Truong , Simon Querné

Vision-Language Models (VLMs) encode images and videos into abundant tokens, which contain substantial redundancy and computation cost. While visual token pruning mitigates the issue, most existing methods lack insight into the intrinsic…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Jizhihui Liu , Feiyi Du , Guangdao Zhu , Niu Lian , Jun Li , Bin Chen , Weili Guan , Yaowei Wang

While Large Vision-Language Models (LVLMs) demonstrate exceptional multi-modal capabilities, the quadratic computational cost of processing high-resolution visual tokens remains a critical bottleneck. Though recent token reduction…

Computer Vision and Pattern Recognition · Computer Science 2026-03-19 Surendra Pathak , Bo Han

Vision Transformers (ViTs) have computational costs scaling quadratically with the number of tokens, calling for effective token pruning policies. Most existing policies are handcrafted, lacking adaptivity to varying inputs. Moreover, they…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Chenglong Lu , Shen Liang , Xuewei Wang , Wei Wang

LLM-powered coding agents spend the majority of their token budget reading repository files, yet much of the retrieved code is irrelevant to the task at hand. Existing learned pruners compress this context with a single-objective sequence…

Artificial Intelligence · Computer Science 2026-05-18 Jingjing Wang , Xiwen Chen , Wenhui Zhu , Huayu Li , Zhengxiao He , Feiyang Cai , Ana S. Carreon-Rascon , Xuanzhao Dong , Feng Luo

Vision transformers (ViTs) have recently received explosive popularity, but the huge computational cost is still a severe issue. Since the computation complexity of ViT is quadratic with respect to the input sequence length, a mainstream…

Computer Vision and Pattern Recognition · Computer Science 2021-12-07 Yifan Xu , Zhijie Zhang , Mengdan Zhang , Kekai Sheng , Ke Li , Weiming Dong , Liqing Zhang , Changsheng Xu , Xing Sun

Learning a versatile language-image model is computationally prohibitive under a limited computing budget. This paper delves into the \emph{efficient language-image pre-training}, an area that has received relatively little attention…

Computer Vision and Pattern Recognition · Computer Science 2026-01-27 Yangyang Guo , Haoyu Zhang , Yongkang Wong , Liqiang Nie , Mohan Kankanhalli

Recent progress in vision-language models (VLMs) has led to impressive results in document understanding tasks, but their high computational demands remain a challenge. To mitigate the compute burdens, we propose a lightweight token pruning…

Computer Vision and Pattern Recognition · Computer Science 2026-03-05 Jaemin Son , Sujin Choi , Inyong Yun

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

Recently, large language models (LLMs) have demonstrated superior performance across various tasks by adhering to scaling laws, which significantly increase model size. However, the huge computation overhead during inference hinders the…

Computation and Language · Computer Science 2024-12-17 Zekai Li , Jintu Zheng , Ji Liu , Han Liu , Haowei Zhu , Zeping Li , Fuwei Yang , Haiduo Huang , Jinzhang Peng , Dong Li , Lu Tian , Emad Barsoum

Diffusion Transformers (DiTs) deliver remarkable image and video generation quality but incur high computational cost, limiting scalability and on-device deployment. We introduce CoReDiT, a structured token pruning framework for DiTs across…

Computer Vision and Pattern Recognition · Computer Science 2026-05-15 Zhuojin Li , Hsin-Pai Cheng , Hong Cai , Shizhong Han , Fatih Porikli

Although vision transformers (ViTs) have shown promising results in various computer vision tasks recently, their high computational cost limits their practical applications. Previous approaches that prune redundant tokens have demonstrated…

Computer Vision and Pattern Recognition · Computer Science 2023-04-24 Siyuan Wei , Tianzhu Ye , Shen Zhang , Yao Tang , Jiajun Liang

Multi-head self-attention is a distinctive feature extraction mechanism of vision transformers that computes pairwise relationships among all input patches, contributing significantly to their high performance. However, it is known to incur…

Computer Vision and Pattern Recognition · Computer Science 2025-07-28 Yuki Igaue , Hiroaki Aizawa

Large Vision-Language Models (LVLMs) have demonstrated remarkable capabilities across a range of multimodal tasks. However, their inference efficiency is constrained by the large number of visual tokens processed during decoding. To address…

Computer Vision and Pattern Recognition · Computer Science 2025-02-21 Yu Meng , Kaiyuan Li , Chenran Huang , Chen Gao , Xinlei Chen , Yong Li , Xiaoping Zhang

The recent paradigm shift to large-scale foundation models has brought about a new era for deep learning that, while has found great success in practice, has also been plagued by prohibitively expensive costs in terms of high memory…

Machine Learning · Computer Science 2025-05-21 Stephen Zhang , Vardan Papyan

Vision Transformers (ViTs) deliver state-of-the-art accuracy but their quadratic attention cost and redundant computations severely hinder deployment on latency and resource-constrained platforms. Existing pruning approaches treat either…

Computer Vision and Pattern Recognition · Computer Science 2025-12-24 Mohammad Helal Uddin , Liam Seymour , Sabur Baidya

Token dropping is a recently-proposed strategy to speed up the pretraining of masked language models, such as BERT, by skipping the computation of a subset of the input tokens at several middle layers. It can effectively reduce the training…

Computation and Language · Computer Science 2023-05-25 Qihuang Zhong , Liang Ding , Juhua Liu , Xuebo Liu , Min Zhang , Bo Du , Dacheng Tao

Recent Vision-Language Models (VLMs) have demonstrated remarkable multimodal understanding capabilities, yet the redundant visual tokens incur prohibitive computational overhead and degrade inference efficiency. Prior studies typically…

Computer Vision and Pattern Recognition · Computer Science 2026-02-24 Qiankun Ma , Ziyao Zhang , Haofei Wang , Jie Chen , Zhen Song , Hairong Zheng

Large multimodal models (LMMs) "see" images by leveraging the attention mechanism between text and visual tokens in the transformer decoder. Ideally, these models should focus on key visual information relevant to the text token. However,…

Computer Vision and Pattern Recognition · Computer Science 2025-03-06 Seil Kang , Jinyeong Kim , Junhyeok Kim , Seong Jae Hwang

Making large language models (LLMs) more efficient in memory, latency, and serving cost is crucial for edge deployment, interactive applications, and sustainable inference at scale. Pruning is a promising technique, but existing pruning…

Computation and Language · Computer Science 2025-10-13 Eugene Kwek , Wenpeng Yin