English
Related papers

Related papers: Efficient Token Compression for Vision Transformer…

200 papers

Transformers have demonstrated remarkable success across vision, language, and video. Yet, increasing task complexity has led to larger models and more tokens, raising the quadratic cost of self-attention and the overhead of GPU memory…

Computer Vision and Pattern Recognition · Computer Science 2025-08-04 Joonmyung Choi , Sanghyeok Lee , Byungoh Ko , Eunseo Kim , Jihyung Kil , Hyunwoo J. Kim

Deep neural networks have been the predominant paradigm in machine learning for solving cognitive tasks. Such models, however, are restricted by a high computational overhead, limiting their applicability and hindering advancements in the…

Machine Learning · Computer Science 2024-11-05 Ian Pons , Bruno Yamamoto , Anna H. Reali Costa , Artur Jordao

Vision Transformers (ViTs) have achieved remarkable success across various vision tasks, yet their deployment is often hindered by prohibitive computational costs. While structured weight pruning and token compression have emerged as…

Computer Vision and Pattern Recognition · Computer Science 2026-02-19 Hyunchan Moon , Cheonjun Park , Steven L. Waslander

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 Vision-Language Models (LVLMs) have advanced multimodal learning but face high computational costs due to the large number of visual tokens, motivating token pruning to improve inference efficiency. The key challenge lies in…

Computer Vision and Pattern Recognition · Computer Science 2025-11-18 Ao Li , Yuxiang Duan , Jinghui Zhang , Congbo Ma , Yutong Xie , Gustavo Carneiro , Mohammad Yaqub , Hu Wang

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

Attention is sparse in vision transformers. We observe the final prediction in vision transformers is only based on a subset of most informative tokens, which is sufficient for accurate image recognition. Based on this observation, we…

Computer Vision and Pattern Recognition · Computer Science 2021-10-27 Yongming Rao , Wenliang Zhao , Benlin Liu , Jiwen Lu , Jie Zhou , Cho-Jui Hsieh

Feed-forward 3D reconstruction models based on Vision Transformers can directly estimate scene geometry and camera poses from a small set of input images, but scaling them to video inputs with hundreds or thousands of frames remains…

Computer Vision and Pattern Recognition · Computer Science 2026-05-20 Zecheng Tang , Jiaye Fu , Qiankun Gao , Haijie Li , Yanmin Wu , Jiaqi Zhang , Siwei Ma , Jian Zhang

Large Multimodal Models (LMMs) have achieved significant success across various tasks. These models usually encode visual inputs into dense token sequences, which are then concatenated with textual tokens and jointly processed by a language…

Computer Vision and Pattern Recognition · Computer Science 2025-10-03 Hao Zhang , Mengsi Lyu , Chenrui He , Yulong Ao , Yonghua Lin

This work presents Adaptive Local-then-Global Merging (ALGM), a token reduction method for semantic segmentation networks that use plain Vision Transformers. ALGM merges tokens in two stages: (1) In the first network layer, it merges…

Computer Vision and Pattern Recognition · Computer Science 2024-06-17 Narges Norouzi , Svetlana Orlova , Daan de Geus , Gijs Dubbelman

Model pruning seeks to induce sparsity in a deep neural network's various connection matrices, thereby reducing the number of nonzero-valued parameters in the model. Recent reports (Han et al., 2015; Narang et al., 2017) prune deep networks…

Machine Learning · Statistics 2017-11-15 Michael Zhu , Suyog Gupta

Video large language models (Video-LLMs) face high computational costs due to large volumes of visual tokens. Existing token compression methods typically adopt a two-stage spatiotemporal compression strategy, relying on stage-specific…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Junhao Du , Jialong Xue , Anqi Li , Jincheng Dai , Guo Lu

Recent token reduction methods for Vision Transformers (ViTs) incorporate token merging, which measures the similarities between token embeddings and combines the most similar pairs. However, their merging policies are directly dependent on…

Computer Vision and Pattern Recognition · Computer Science 2024-12-17 Dong Hoon Lee , Seunghoon Hong

As Vision Transformers (ViTs) increasingly set new benchmarks in computer vision, their practical deployment on inference engines is often hindered by their significant memory bandwidth and (on-chip) memory footprint requirements. This…

Computer Vision and Pattern Recognition · Computer Science 2024-02-12 Seyedarmin Azizi , Mahdi Nazemi , Massoud Pedram

Video transformer models require huge amounts of compute resources due to the spatio-temporal scaling of the input. Tackling this, recent methods have proposed to drop or merge tokens for image models, whether randomly or via learned…

Computer Vision and Pattern Recognition · Computer Science 2025-10-24 Sam Pollard , Michael Wray

Transformer-based models generally allocate the same amount of computation for each token in a given sequence. We develop a simple but effective "token dropping" method to accelerate the pretraining of transformer models, such as BERT,…

Computation and Language · Computer Science 2022-03-25 Le Hou , Richard Yuanzhe Pang , Tianyi Zhou , Yuexin Wu , Xinying Song , Xiaodan Song , Denny Zhou

Deploying transformer models in practice is challenging due to their inference cost, which scales quadratically with input sequence length. To address this, we present a novel Learned Token Pruning (LTP) method which adaptively removes…

Computation and Language · Computer Science 2022-06-06 Sehoon Kim , Sheng Shen , David Thorsley , Amir Gholami , Woosuk Kwon , Joseph Hassoun , Kurt Keutzer

Vision-language models (VLMs) excel at image understanding tasks, but the large number of visual tokens imposes significant computational costs, hindering deployment on mobile devices. Many pruning methods rely solely on token importance…

Computer Vision and Pattern Recognition · Computer Science 2026-02-27 Zhenkai Wu , Xiaowen Ma , Zhenliang Ni , Dengming Zhang , Han Shu , Xin Jiang , Xinghao Chen

Pruning is an efficient model compression technique to remove redundancy in the connectivity of deep neural networks (DNNs). Computations using sparse matrices obtained by pruning parameters, however, exhibit vastly different parallelism…

Machine Learning · Computer Science 2019-05-15 Dongsoo Lee , Se Jung Kwon , Byeongwook Kim , Parichay Kapoor , Gu-Yeon Wei

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
‹ Prev 1 4 5 6 7 8 10 Next ›