Greedy-layer Pruning: Speeding up Transformer Models for Natural Language Processing
Not on the map. Why?
Abstract (arXiv)
Fine-tuning transformer models after unsupervised pre-training reaches a very high performance on many different natural language processing tasks. Unfortunately, transformers suffer from long inference times which greatly increases costs in production. One possible solution is to use knowledge distillation, which solves this problem by transferring information from large teacher models to smaller student models. Knowledge distillation maintains high performance and reaches high compression rates, nevertheless, the size of the student model is fixed after pre-training and can not be changed individually for a given downstream task and use-case to reach a desired performance/speedup ratio. Another solution to reduce the size of models in a much more fine-grained and computationally cheaper fashion is to prune layers after the pre-training. The price to pay is that the performance of layer-wise pruning algorithms is not on par with state-of-the-art knowledge distillation methods. In this paper, Greedy-layer pruning is introduced to (1) outperform current state-of-the-art for layer-wise pruning, (2) close the performance gap when compared to knowledge distillation, while (3) providing a method to adapt the model size dynamically to reach a desired performance/speedup tradeoff without the need of additional pre-training phases. Our source code is available on https://github.com/deepopinion/greedy-layer-pruning.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 21 of its 31 references that are in the map. First posted on arXiv 31 May 2021.
Builds on
21 of 31 references.
References · 21
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
- 2018Neural Network Acceptability Judgmentscited by 952
- 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
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
9 more
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2020Compressing Large-Scale Transformer-Based Models: A Case Study on BERTcited by 95
- 2021How to Train BERT with an Academic Budgetcited by 80
- 2020Contrastive Distillation on Intermediate Representations for Language Model Compressioncited by 57
- 2019Constrained Deep Networks: Lagrangian Optimization via Log-Barrier Extensionscited by 30
- 2020Multi-task learning for natural language processing in the 2020s: where are we going?cited by 27
- 2020Know What You Don't Need: Single-Shot Meta-Pruning for Attention Headscited by 16
- 2020Conflicting Bundles: Adapting Architectures Towards the Improved Training of Deep Neural Networkscited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 4; 2025: 0; 2026: 3.
11 papers.
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2022Extreme Compression for Pre-trained Transformers Made Simple and Efficientcited by 19
- 2024ANLS* -- A Universal Document Processing Metric for Generative Large Language Modelscited by 10
- 2023The EarlyBIRD Catches the Bug: On Exploiting Early Layers of Encoder Models for More Efficient Code Classificationcited by 5
- 2024Optimising TinyML with Quantization and Distillation of Transformer and Mamba Models for Indoor Localisation on Edge Devicescited by 5
- 2024Layer Collapse Can be Induced by Unstructured Pruningcited by 4
- 2024Why Lift so Heavy? Slimming Large Language Models by Cutting Off the Layerscited by 2
- 2026Understanding Pruning Regimes in Vision-Language Models Through Domain-Aware Layer Selectioncited by 1
- 2023SPION: Layer-Wise Sparse Training of Transformer via Convolutional Flood Fillingcited by 0
- 2026TAPIOCA: Why Task- Aware Pruning Improves OOD model Capabilitycited by 0
- 2026Efficient Multilingual Neural Machine Translation via Corpus-Driven Vocabulary Pruning: An English-Arabic Case Studycited by 0
- 2026Efficient Multilingual Neural Machine Translation via Corpus-Driven Vocabulary Pruning: An English-Arabic Case Study4 Aug 2026
- 2026TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability14 May 2026
- 2026Understanding Pruning Regimes in Vision-Language Models Through Domain-Aware Layer Selection17 Mar 2026
- 2024Optimising TinyML with Quantization and Distillation of Transformer and Mamba Models for Indoor Localisation on Edge Devices12 Dec 2024
- 2024Layer Collapse Can be Induced by Unstructured Pruning24 Apr 2024
- 2024Why Lift so Heavy? Slimming Large Language Models by Cutting Off the Layers18 Feb 2024
- 2024ANLS* -- A Universal Document Processing Metric for Generative Large Language Models6 Feb 2024
- 2023SPION: Layer-Wise Sparse Training of Transformer via Convolutional Flood Filling22 Sep 2023
- 2023The EarlyBIRD Catches the Bug: On Exploiting Early Layers of Encoder Models for More Efficient Code Classification8 May 2023
- 2023Gradient-Free Structured Pruning with Unlabeled Data7 Mar 2023
- 2022Extreme Compression for Pre-trained Transformers Made Simple and Efficient4 Jun 2022