A Survey on Efficient Vision Transformers: Algorithms, Techniques, and Performance Benchmarking

被引:5
|
作者
Papa, Lorenzo [1 ,2 ]
Russo, Paolo [1 ]
Amerini, Irene [1 ]
Zhou, Luping [2 ]
机构
[1] Sapienza Univ Rome, Dept Comp Control & Management Engn, I-00185 Rome, Italy
[2] Univ Sydney, Sch Elect & Informat Engn, Fac Engn, Sydney, NSW 2006, Australia
关键词
Computer vision; computational efficiency; vision transformer;
D O I
10.1109/TPAMI.2024.3392941
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Vision Transformer (ViT) architectures are becoming increasingly popular and widely employed to tackle computer vision applications. Their main feature is the capacity to extract global information through the self-attention mechanism, outperforming earlier convolutional neural networks. However, ViT deployment and performance have grown steadily with their size, number of trainable parameters, and operations. Furthermore, self-attention's computational and memory cost quadratically increases with the image resolution. Generally speaking, it is challenging to employ these architectures in real-world applications due to many hardware and environmental restrictions, such as processing and computational capabilities. Therefore, this survey investigates the most efficient methodologies to ensure sub-optimal estimation performances. More in detail, four efficient categories will be analyzed: compact architecture, pruning, knowledge distillation, and quantization strategies. Moreover, a new metric called Efficient Error Rate has been introduced in order to normalize and compare models' features that affect hardware devices at inference time, such as the number of parameters, bits, FLOPs, and model size. Summarizing, this paper first mathematically defines the strategies used to make Vision Transformer efficient, describes and discusses state-of-the-art methodologies, and analyzes their performances over different application scenarios. Toward the end of this paper, we also discuss open challenges and promising research directions.
引用
收藏
页码:7682 / 7700
页数:19
相关论文
共 50 条
  • [41] A survey of penalty techniques in genetic algorithms
    Gen, M
    Cheng, RW
    1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 804 - 809
  • [42] Vessel extraction techniques and algorithms : A survey
    Kirbas, C
    Quek, FKH
    THIRD IEEE SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING - BIBE 2003, PROCEEDINGS, 2003, : 238 - 245
  • [43] SURVEY OF ANALYSIS TECHNIQUES FOR DISCRETE ALGORITHMS
    WEIDE, B
    COMPUTING SURVEYS, 1977, 9 (04) : 291 - 313
  • [44] Performance Benchmarking and Optimization for Blockchain Systems: A Survey
    Wang, Rui
    Ye, Kejiang
    Xu, Cheng-Zhong
    BLOCKCHAIN - ICBC 2019, 2019, 11521 : 171 - 185
  • [45] Performance evaluation and benchmarking on document layout analysis algorithms
    Wu, J
    Pan, WM
    Jin, HM
    Wang, QR
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 2246 - 2250
  • [46] Benchmarking the performance of genetic algorithms on constrained dynamic problems
    Grudniewski, P. A.
    Sobey, A. J.
    NATURAL COMPUTING, 2022, 21 (01) : 109 - 125
  • [47] Performance measure and tool for benchmarking metaheuristic optimization algorithms
    Schott, Francois
    Chamoret, Dominique
    Baron, Thomas
    Salmon, Sebastien
    Meyer, Yann
    JOURNAL OF APPLIED AND COMPUTATIONAL MECHANICS, 2021, 7 (03): : 1803 - 1813
  • [48] PERFORMANCE PROFILES FOR BENCHMARKING OF GLOBAL SENSITIVITY ANALYSIS ALGORITHMS
    Lucay, F. A.
    Lopez-Arenas, T.
    Sales-Cruz, M.
    Galvez, E. D.
    Cisternas, L. A.
    REVISTA MEXICANA DE INGENIERIA QUIMICA, 2020, 19 (01): : 423 - 444
  • [49] Performance Benchmarking of Network Function Chain Placement Algorithms
    Grigorjew, Alexej
    Lange, Stanislav
    Zinner, Thomas
    Tran-Gia, Phuoc
    MEASUREMENT, MODELLING AND EVALUATION OF COMPUTING SYSTEMS, MMB 2018, 2018, 10740 : 83 - 98
  • [50] Benchmarking the performance of genetic algorithms on constrained dynamic problems
    P. A. Grudniewski
    A. J. Sobey
    Natural Computing, 2022, 21 : 109 - 125