Cited by 128Advanced Neural Network ApplicationsEmbedded Systems Design TechniquesEmbedded Systems and FPGA Applications

HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers

Open access
Dong, Peiyan, Sun, Mengshu, Lu, Alec, Xie, Yanyue, Liu, Kenneth, Kong, Zhenglun, Meng, Xin, Li, Zhengang +3 more·2023·2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)

Abstract

While vision transformers (ViTs) have continuously achieved new milestones in the field of computer vision, their sophisticated network architectures with high computation and memory costs have impeded their deployment on resource-limited edge devices. In this paper, we propose a hardware-efficient image-adaptive token pruning framework called HeatViT for efficient yet accurate ViT acceleration on embedded FPGAs. Based on the inherent computational patterns in ViTs, we first adopt an effective, hardware-efficient, and learnable head-evaluation token selector, which can be progressively inserted before transformer blocks to dynamically identify and consolidate the non-informative tokens from input images. Moreover, we implement the token selector on hardware by adding miniature control logic to heavily reuse existing hardware components built for the backbone ViT. To improve the hardware efficiency, we further employ 8-bit fixed-point quantization and propose polynomial approximations with regularization effect on quantization error for the frequently used nonlinear functions in ViTs. Compared to existing ViT pruning studies, under the similar computation cost, HeatViT can achieve 0.7% ~ 8.9% higher accuracy; while under the similar model accuracy, HeatViT can achieve more than 28.4% ~ 65.3% computation reduction, for various widely used ViTs, including DeiT-T, DeiT-S, DeiT-B, LV-ViT-S, and LV-ViT-M, on the ImageNet dataset. Compared to the baseline hardware accelerator, our implementations of HeatViT on the Xilinx ZCU102 FPGA achieve 3.46×~4.89× speedup with a trivial resource utilization overhead of 8%~11% more DSPs and 5%~8% more LUTs.

Integrity signals

Registry

Crossref · 10.1109/hpca56546.2023.10071047

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • HeatViT and Auto-ViT-Acc fail to consider the inherent data distribution within ViTs, resulting in inconsistencies between the quantization strategy and the data distribution.

    “HeatViT and Auto-ViT-Acc fail to consider the inherent data distribution within ViTs, resulting in inconsistencies between the quantization strategy and the data distribution.”
  • HeatViT uses polynomial approximations for GeLU and Softmax, quantizing them into INT8, but this approach consumes a significant amount of FF/LUT resources due to the exponent e in Softmax.

    “HeatViT [30] uses polynomial approximations for GeLU and Softmax, quantizing them into INT8. However, this approach consumes a significant amount of FF/LUT resources due to the exponent ‘e’ in Softmax.”
  • TinyBERT with only four self-attention layers can match 96.8% predictive performance of the teacher BERT-base network on the GLUE benchmark while being 7.5 times smaller.

    “TinyBERT with only four selfattention layers can match 96.8% predictive performance of the teacher BERT-base network on GLUE benchmark while being 7.5 × smaller.”

    From A Survey of Techniques for Optimizing Transformer Inference (2023) · cites this paper as [70]

  • Knowledge distillation methods have been effective in compressing large transformer models such as DistilBERT and TinyBERT.

    “KD methods have been effective in compressing large transformer models, such as DistilBERT [47], TinyBERT [70] etc.”

    From A Survey of Techniques for Optimizing Transformer Inference (2023) · cites this paper as [70]

The citation lists haven’t been fetched yet

References 62 · Cited by 128

Authors
Dong, P., Sun, M., Lu, A., Xie, Y., Liu, K., Kong, Z., Meng, X., Li, Z., Lin, X., Fang, Z., & Wang, Y.
Affiliations
  • Northeastern University (US)
  • Simon Fraser University (CA)
Venue
2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)
Publisher
IEEE
Published
2023-02
Pages
442-455
ISSN
1530-0897 (ISSN-L)
OpenAlex
W4360831786
Cited by
128
References
62
Citations by year
2026: 31 · 2025: 59 · 2024: 30 · 2023: 8
FWCI
13.69
Type
conference paper
Language
en
Open access
Locations
  • IEEE International Symposium on High-Performance Computer Architecture (HPCA) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
Funders
  • National Science Foundation (1901378)
  • Natural Sciences and Engineering Research Council of Canada (rgpas-2019-00120, 552042-2020, RGPIN-2019, rgpin-2019-04613)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Embedded Systems and FPGA Applications
Keywords
vision transformer, token pruning, FPGA acceleration, edge devices, polynomial approximation, model compression, computation reduction, Xilinx ZCU102

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review