paper-with-me

Papers

Learned Thresholds Token Merging and Pruning for Vision Transformers

2023-07-20 · Maxim Bonnaerens, Joni Dambre

Vision transformers have demonstrated remarkable success in a wide range of computer vision tasks over the last years. However, their high computational costs remain a significant barrier to their practical deployment. In particular, the complexity of transformer models is quadratic with respect to the number of input tokens. Therefore techniques that reduce the number of input tokens that need to be processed have been proposed. This paper introduces Learned Thresholds token Merging and Pruning (LTMP), a novel approach that leverages the strengths of both token merging and token pruning. LTMP uses learned threshold masking modules that dynamically determine which tokens to merge and which to prune. We demonstrate our approach with extensive experiments on vision transformers on the ImageNet classification task. Our results demonstrate that LTMP achieves state-of-the-art accuracy across reduction rates while requiring only a single fine-tuning epoch, which is an order of magnitude faster than previous methods. Code is available at https://github.com/Mxbonn/ltmp .

📄 PDF Abstract BibTeX arXiv:2307.10780

Code (1)

mxbonn/ltmp 공식 구현 pytorch

Tasks

Efficient ViTs

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention

2022-09-28 · Xiangcheng Liu, Tianyi Wu, Guodong Guo

Vision transformer has emerged as a new paradigm in computer vision, showing excellent performance while accompanied by expensive computational cost. Image token pruning is one of the main approaches for ViT compression,…

Efficient ViTsInformativeness

Token Fusion: Bridging the Gap between Token Pruning and Token Merging

2023-12-02 · Minchul Kim, Shangqian Gao, Yen-Chang Hsu, Yilin Shen 외

Vision Transformers (ViTs) have emerged as powerful backbones in computer vision, outperforming many traditional CNNs. However, their computational overhead, largely attributed to the self-attention mechanism, makes depl…

Computational EfficiencyImage Generation

Similarity-Aware Token Pruning: Your VLM but Faster

2025-03-14 · Ahmadreza Jeddi, Negin Baghbanzadeh, Elham Dolatabadi, Babak Taati

The computational demands of Vision Transformers (ViTs) and Vision-Language Models (VLMs) remain a significant challenge due to the quadratic complexity of self-attention. While token pruning offers a promising solution,…

Libra-Merging: Importance-redundancy and Pruning-merging Trade-off for Acceleration Plug-in in Large Vision-Language Model

2025-01-01 · CVPR 2025 1 · Longrong Yang, Dong Shen, Chaoxiang Cai, Kaibing Chen 외

Large Vision-Language Models (LVLMs) have achieved significant progress in recent years. However, the expensive inference cost limits the realistic deployment of LVLMs. Some works find that visual tokens are redundan…

Language ModelingLanguage Modelling

DiffRate : Differentiable Compression Rate for Efficient Vision Transformers

2023-05-29 · ICCV 2023 1 · Mengzhao Chen, Wenqi Shao, Peng Xu, Mingbao Lin 외

Token compression aims to speed up large-scale vision transformers (e.g. ViTs) by pruning (dropping) or merging tokens. It is an important but challenging task. Although recent advanced approaches achieved great success,…

Efficient ViTs