Hybrid Dynamic Pruning: A Pathway to Efficient Transformer Inference
Not on the map. Why?
Abstract (arXiv)
In the world of deep learning, Transformer models have become very significant, leading to improvements in many areas from understanding language to recognizing images, covering a wide range of applications. Despite their success, the deployment of these models in real-time applications, particularly on edge devices, poses significant challenges due to their quadratic computational intensity and memory demands. To overcome these challenges we introduce a novel Hybrid Dynamic Pruning (HDP), an efficient algorithm-architecture co-design approach that accelerates transformers using head sparsity, block sparsity and approximation opportunities to reduce computations in attention and reduce memory access. With the observation of the huge redundancy in attention scores and attention heads, we propose a novel integer-based row-balanced block pruning to prune unimportant blocks in the attention matrix at run time, also propose integer-based head pruning to detect and prune unimportant heads at an early stage at run time. Also we propose an approximation method that reduces attention computations. To efficiently support these methods with lower latency and power efficiency, we propose a HDP co-processor architecture.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 40 references that are in the map. First posted on arXiv 17 Jul 2024.
Builds on
29 of 40 references.
References · 29
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2020End-to-End Object Detection with Transformerscited by 7,384
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
17 more
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2020Efficient Transformers: A Surveycited by 784
- 2021CMT: Convolutional Neural Networks Meet Vision Transformerscited by 310
- 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
- 2019Leveraging Pre-trained Checkpoints for Sequence Generation Taskscited by 182
- 2019Blockwise Self-Attention for Long Document Understandingcited by 158
- 2019Well-Read Students Learn Better: On the Importance of Pre-training Compact Modelscited by 118
- 2020A3: Accelerating Attention Mechanisms in Neural Networks with Approximationcited by 97
- 2017Adaptive Quantization for Deep Neural Networkcited by 67
- 2019Visualizing and Understanding the Effectiveness of BERTcited by 67
- 2022An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformerscited by 28
- 2021Energon: Towards Efficient Acceleration of Transformers Using Dynamic Sparse Attentioncited by 26
- 2023AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformerscited by 24
- 2020Know What You Don't Need: Single-Shot Meta-Pruning for Attention Headscited by 16
- 2021On the Distribution, Sparsity, and Inference-time Quantization of Attention Values in Transformerscited by 14
- 2022P-Transformer: Towards Better Document-to-Document Neural Machine Translationcited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.