VTrans: Accelerating Transformer Compression with Variational Information Bottleneck based Pruning
Not on the map. Why?
Abstract (arXiv)
In recent years, there has been a growing emphasis on compressing large pre-trained transformer models for resource-constrained devices. However, traditional pruning methods often leave the embedding layer untouched, leading to model over-parameterization. Additionally, they require extensive compression time with large datasets to maintain performance in pruned models. To address these challenges, we propose VTrans, an iterative pruning framework guided by the Variational Information Bottleneck (VIB) principle. Our method compresses all structural components, including embeddings, attention heads, and layers using VIB-trained masks. This approach retains only essential weights in each layer, ensuring compliance with specified model size or computational constraints. Notably, our method achieves upto 70% more compression than prior state-of-the-art approaches, both task-agnostic and task-specific. We further propose faster variants of our method: Fast-VTrans utilizing only 3% of the data and Faster-VTrans, a time efficient alternative that involves exclusive finetuning of VIB masks, accelerating compression by upto 25 times with minimal performance loss compared to previous methods. Extensive experiments on BERT, ROBERTa, and GPT-2 models substantiate the efficacy of our method. Moreover, our method demonstrates scalability in compressing large models such as LLaMA-2-7B, achieving superior performance compared to previous pruning methods. Additionally, we use attention-based probing to qualitatively assess model redundancy and interpret the efficiency of our approach. Notably, our method considers heads with high attention to special and current tokens in un-pruned model as foremost candidates for pruning while retained heads are observed to attend more to task-critical keywords.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 54 of its 68 references that are in the map. First posted on arXiv 7 Jun 2024.
Builds on
54 of 68 references.
References · 54
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 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
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
38 more
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2018Neural Network Acceptability Judgmentscited by 952
- 2016Deep Variational Information Bottleneckcited by 915
- 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
- 2015Deep Learning and the Information Bottleneck Principlecited by 793
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2019Q8BERT: Quantized 8Bit BERTcited by 296
- 2021I-BERT: Integer-only BERT Quantizationcited by 250
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
- 2020MiniLMv2: Multi-Head Self-Attention Relation Distillation for Compressing Pretrained Transformerscited by 240
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2019Structured Pruning of Large Language Modelscited by 201
- 2021Block Pruning For Faster Transformerscited by 176
- 2020BinaryBERT: Pushing the Limit of BERT Quantizationcited by 175
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2019Distilling Task-Specific Knowledge from BERT into Simple Neural Networkscited by 152
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2022Less is More: Task-aware Layer-wise Distillation for Language Model Compressioncited by 91
- 2019Knowledge Distillation from Internal Representationscited by 87
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
- 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
- 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 42
- 2023HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformerscited by 25
- 2021MergeDistill: Merging Pre-trained Language Models using Distillationcited by 13
- 2020A Variational Information Bottleneck Based Method to Compress Sequential Networks for Human Action Recognitioncited by 7
- 2022Task-specific Compression for Multi-task Language Models using Attribution-based Pruningcited by 7
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.