ROSITA: Refined BERT cOmpreSsion with InTegrAted techniques
Not on the map. Why?
Abstract (arXiv)
Pre-trained language models of the BERT family have defined the state-of-the-arts in a wide range of NLP tasks. However, the performance of BERT-based models is mainly driven by the enormous amount of parameters, which hinders their application to resource-limited scenarios. Faced with this problem, recent studies have been attempting to compress BERT into a small-scale model. However, most previous work primarily focuses on a single kind of compression technique, and few attention has been paid to the combination of different methods. When BERT is compressed with integrated techniques, a critical question is how to design the entire compression framework to obtain the optimal performance. In response to this question, we integrate three kinds of compression methods (weight pruning, low-rank factorization and knowledge distillation (KD)) and explore a range of designs concerning model architecture, KD strategy, pruning frequency and learning rate schedule. We find that a careful choice of the designs is crucial to the performance of the compressed model. Based on the empirical findings, our best compressed model, dubbed Refined BERT cOmpreSsion with InTegrAted techniques (ROSITA), is 7.5 × smaller than BERT while maintains 98.5% of the performance on five tasks of the GLUE benchmark, outperforming the previous BERT compression methods with similar parameter budget. The code is available at https://github.com/llyx97/Rosita.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 24 of its 26 references that are in the map. First posted on arXiv 21 Mar 2021.
Builds on
24 of 26 references.
References · 24
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,811
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2019Improved Knowledge Distillation via Teacher Assistantcited by 573
12 more
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 508
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 482
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 251
- 2019Structured Pruning of Large Language Modelscited by 203
- 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 185
- 2019Distilling Task-Specific Knowledge from BERT into Simple Neural Networkscited by 153
- 2020TernaryBERT: Distillation-aware Ultra-low Bit BERTcited by 148
- 2019Well-Read Students Learn Better: On the Importance of Pre-training Compact Modelscited by 120
- 2020BERT-of-Theseus: Compressing BERT by Progressive Module Replacingcited by 113
- 2020LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compressioncited by 45
- 2020BERT-EMD: Many-to-Many Layer Mapping for BERT Compression with Earth Mover's Distancecited by 27
Built on by
Citing papers per year: 2021: 2; 2022: 5; 2023: 4; 2024: 3.
14 papers.
Sort:
By area:
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
- 2023X-Pruner: eXplainable Pruning for Vision Transformerscited by 68
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2024Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruningcited by 15
- 2022HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compressioncited by 9
- 2022Task-specific Compression for Multi-task Language Models using Attribution-based Pruningcited by 7
- 2022A Win-win Deal: Towards Sparse and Robust Pre-trained Language Modelscited by 7
- 2021Marginal Utility Diminishes: Exploring the Minimum Knowledge for BERT Knowledge Distillationcited by 6
- 2023rm SP3: Enhancing Structured Pruning via PCA Projectioncited by 5
- 2024STAT: Shrinking Transformers After Trainingcited by 2
- 2023Deep Model Compression Also Helps Models Capture Ambiguitycited by 1
- 2021BERMo: What can BERT learn from ELMo?cited by 0
- 2024Automated Classification of Cybercrime Complaints using Transformer-based Language Models for Hinglish Texts21 Dec 2024
- 2024Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruning6 Jun 2024
- 2024STAT: Shrinking Transformers After Training29 May 2024
- 2023rm SP3: Enhancing Structured Pruning via PCA Projection31 Aug 2023
- 2023Deep Model Compression Also Helps Models Capture Ambiguity12 Jun 2023
- 2023X-Pruner: eXplainable Pruning for Vision Transformers8 Mar 2023
- 2023Gradient-Free Structured Pruning with Unlabeled Data7 Mar 2023
- 2022HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression30 Nov 2022
- 2022Compressing And Debiasing Vision-Language Pre-Trained Models for Visual Question Answering26 Oct 2022
- 2022A Win-win Deal: Towards Sparse and Robust Pre-trained Language Models11 Oct 2022
- 2022Task-specific Compression for Multi-task Language Models using Attribution-based Pruning9 May 2022
- 2022A Fast Post-Training Pruning Framework for Transformers29 Mar 2022
2 more
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
- 2023X-Pruner: eXplainable Pruning for Vision Transformerscited by 68
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2024Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruningcited by 15
- 2022HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compressioncited by 9
- 2022Task-specific Compression for Multi-task Language Models using Attribution-based Pruningcited by 7
- 2022A Win-win Deal: Towards Sparse and Robust Pre-trained Language Modelscited by 7
- 2023rm SP3: Enhancing Structured Pruning via PCA Projectioncited by 5
- 2024STAT: Shrinking Transformers After Trainingcited by 2
- 2023Deep Model Compression Also Helps Models Capture Ambiguitycited by 1
- 2021BERMo: What can BERT learn from ELMo?cited by 0
- 2024Automated Classification of Cybercrime Complaints using Transformer-based Language Models for Hinglish Textscited by 0
- 2024Automated Classification of Cybercrime Complaints using Transformer-based Language Models for Hinglish Texts21 Dec 2024
- 2024Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruning6 Jun 2024
- 2024STAT: Shrinking Transformers After Training29 May 2024
- 2023rm SP3: Enhancing Structured Pruning via PCA Projection31 Aug 2023
- 2023Deep Model Compression Also Helps Models Capture Ambiguity12 Jun 2023
- 2023X-Pruner: eXplainable Pruning for Vision Transformers8 Mar 2023
- 2023Gradient-Free Structured Pruning with Unlabeled Data7 Mar 2023
- 2022HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression30 Nov 2022
- 2022A Win-win Deal: Towards Sparse and Robust Pre-trained Language Models11 Oct 2022
- 2022Task-specific Compression for Multi-task Language Models using Attribution-based Pruning9 May 2022
- 2022A Fast Post-Training Pruning Framework for Transformers29 Mar 2022
- 2021BERMo: What can BERT learn from ELMo?18 Oct 2021
Similar, not cited
Close in wording, no citation either way
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models
- 2023Improving Knowledge Distillation for BERT Models: Loss Functions, Mapping Methods, and Weight Tuning
- 2022Exploring Extreme Parameter Compression for Pre-trained Language Models
- 2022Combining Compressions for Multiplicative Size Scaling on Natural Language Tasks
- 2021RefBERT: Compressing BERT by Referencing to Pre-computed Representations
- 2021Robustness Challenges in Model Distillation and Pruning for Natural Language Understanding
- 2021Extract then Distill: Efficient and Effective Task-Agnostic BERT Distillation
- 2021A Short Study on Compressing Decoder-Based Language Models