mlsanityData to 7 Oct 2026

An Automatic and Efficient BERT Pruning for Edge AI Systems

arXiv 2206.10461 ↗First posted 21 Jun 2022cs.CL cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

With the yearning for deep learning democratization, there are increasing demands to implement Transformer-based natural language processing (NLP) models on resource-constrained devices for low-latency and high accuracy. Existing BERT pruning methods require domain experts to heuristically handcraft hyperparameters to strike a balance among model size, latency, and accuracy. In this work, we propose AE-BERT, an automatic and efficient BERT pruning framework with efficient evaluation to select a "good" sub-network candidate (with high accuracy) given the overall pruning ratio constraints. Our proposed method requires no human experts experience and achieves a better accuracy performance on many NLP tasks. Our experimental results on General Language Understanding Evaluation (GLUE) benchmark show that AE-BERT outperforms the state-of-the-art (SOTA) hand-crafted pruning methods on BERTBASE. On QNLI and RTE, we obtain 75% and 42.8% more overall pruning ratio while achieving higher accuracy. On MRPC, we obtain a 4.6 higher score than the SOTA at the same overall pruning ratio of 0.5. On STS-B, we can achieve a 40% higher pruning ratio with a very small loss in Spearman correlation compared to SOTA hand-crafted pruning methods. Experimental results also show that after model compression, the inference time of a single BERTBASE encoder on Xilinx Alveo U200 FPGA board has a 1.83× speedup compared to Intel(R) Xeon(R) Gold 5218 (2.30GHz) CPU, which shows the reasonableness of deploying the proposed method generated subnets of BERTBASE model on computation restricted devices.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 31 of its 40 references that are in the map. First posted on arXiv 21 Jun 2022.

Builds on

31 of 40 references.

References · 31

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  5. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  6. 2020Longformer: The Long-Document Transformercited by 3,362
  7. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  11. 2020Reformer: The Efficient Transformercited by 1,658
  12. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
19 more
  1. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  2. 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
  3. 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,024
  4. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
  5. 2020What is the State of Neural Network Pruning?cited by 578
  6. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
  7. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  8. 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
  9. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  10. 2019HIBERT: Document Level Pre-training of Hierarchical Bidirectional Transformers for Document Summarizationcited by 120
  11. 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
  12. 2019How Does BERT Answer Questions? A Layer-Wise Analysis of Transformer Representationscited by 63
  13. 2019AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Ratescited by 49
  14. 2021Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigmcited by 40
  15. 2020Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruningcited by 39
  16. 2019Reweighted Proximal Pruning for Large-Scale Language Representationcited by 29
  17. 2021Accelerating Framework of Transformer by Hardware Design and Model Compression Co-Optimizationcited by 27
  18. 2018C-LSTM: Enabling Efficient LSTM using Structured Compression Techniques on FPGAscited by 21
  19. 2021Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigmcited by 20

Built on by

Cited by year

Citing papers per year: 2022: 5; 2023: 7; 2024: 0; 2025: 1.

13 papers.

Sort:

By area: