Block Pruning For Faster Transformers
Not on the map. Why?
Abstract (arXiv)
Pre-training has improved model accuracy for both classification and generation tasks at the cost of introducing much larger and slower models. Pruning methods have proven to be an effective way of reducing model size, whereas distillation methods are proven for speeding up inference. We introduce a block pruning approach targeting both small and fast models. Our approach extends structured methods by considering blocks of any size and integrates this structure into the movement pruning paradigm for fine-tuning. We find that this approach learns to prune out full components of the underlying model, such as attention heads. Experiments consider classification and generation tasks, yielding among other results a pruned model that is a 2.4x faster, 74% smaller BERT on SQuAD v1, with a 1% drop on F1, competitive both with distilled models in speed and pruned models in size.
Key facts. Cited by 176 papers in the map (data through 7 Oct 2026). Builds on 31 of its 43 references that are in the map. First posted on arXiv 10 Sep 2021.
Builds on
31 of 43 references.
References · 31
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 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
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2015Teaching Machines to Read and Comprehendcited by 1,039
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
19 more
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 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
- 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
- 2016FastText.zip: Compressing text classification modelscited by 331
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2019Structured Pruning of Large Language Modelscited by 201
- 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
- 2019Distilling Task-Specific Knowledge from BERT into Simple Neural Networkscited by 152
- 2019Well-Read Students Learn Better: On the Importance of Pre-training Compact Modelscited by 118
- 2020Pre-trained Summarization Distillationcited by 70
- 2020Train Large, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformerscited by 67
- 2020LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compressioncited by 45
- 2016Compression of Neural Machine Translation Models via Pruningcited by 43
- 2020FastFormers: Highly Efficient Transformer Models for Natural Language Understandingcited by 28
- 2015Auto-Sizing Neural Networks: With Applications to n-gram Language Modelscited by 9
Built on by
Citing papers per year: 2021: 5; 2022: 31; 2023: 59; 2024: 48; 2025: 22; 2026: 11.
176 papers.
Sort:
By area:
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 400
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
- 2024Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modificationscited by 220
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 140
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2021The Efficiency Misnomercited by 98
38 more
- 2024RLHF Deciphered: A Critical Analysis of Reinforcement Learning from Human Feedback for LLMscited by 89
- 2024A Survey of Resource-efficient LLM and Multimodal Foundation Modelscited by 84
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 80
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
- 2023MatFormer: Nested Transformer for Elastic Inferencecited by 79
- 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
- 2022EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruningcited by 56
- 2023PuMer: Pruning and Merging Tokens for Efficient Vision Language Modelscited by 53
- 2022SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learningcited by 47
- 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 46
- 2022A Survey on Model Compression and Acceleration for Pretrained Language Modelscited by 45
- 2024A Survey on Transformer Compressioncited by 44
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
- 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 42
- 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracycited by 37
- 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
- 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 34
- 2023What Matters In The Structured Pruning of Generative Language Models?cited by 30
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metriccited by 30
- 2024A Survey on Efficient Federated Learning Methods for Foundation Model Trainingcited by 29
- 2024APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inferencecited by 29
- 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2024FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Modelscited by 26
- 2023PIT: Optimization of Dynamic Sparse Deep Learning Models via Permutation Invariant Transformationcited by 25
- 2023HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformerscited by 25
- 2023AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformerscited by 24
- 2023Understanding INT4 Quantization for Transformer Models: Latency Speedup, Composability, and Failure Casescited by 23
- 2023Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspectivecited by 23
- 2022Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Modelscited by 20
- 2022Gender Biases and Where to Find Them: Exploring Gender Bias in Pre-Trained Transformer-based Language Models Using Movement Pruningcited by 20
- 2022A Survey for Efficient Open Domain Question Answeringcited by 20
- 2023LLMs Can Understand Encrypted Prompt: Towards Privacy-Computing Friendly Transformerscited by 20
- 2024Faster and Lighter LLMs: A Survey on Current Challenges and Way Forwardcited by 20
50 most cited of 176 All 176 (JSON)
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning27 Sep 2026
- 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning30 Aug 2026
- 2026Resource-Efficient Pruning for Transformer via Low-Rank Importance Estimation25 Aug 2026
- 2026Accelerating Vision Foundation Models with Drop-in Depthwise Convolution21 May 2026
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Models9 May 2026
- 2026Budgeted Attention Allocation: Cost-Conditioned Compute Control for Efficient Transformers7 May 2026
- 2026An Adapter-free Fine-tuning Approach for Tuning 3D Foundation Models24 Mar 2026
- 2026FastLightGen: Fast and Light Video Generation with Fewer Steps and Parameters2 Mar 2026
- 2026SymTorch: Symbolic Distillation of Neural Networks24 Feb 2026
- 2026Greedy-Gnorm: A Gradient Matrix Norm-Based Alternative to Attention Entropy for Head Pruning4 Feb 2026
- 2026Entropy Reveals Block Importance in Masked Self-Supervised Vision Transformers3 Feb 2026
- 2025LLMCache: Layer-Wise Caching Strategies for Accelerated Reuse in Transformer Inference18 Dec 2025
38 more
- 2025MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity17 Nov 2025
- 2025CatBack: Universal Backdoor Attacks on Tabular Data via Categorical Encoding8 Nov 2025
- 2025TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination26 Oct 2025
- 2025VeFA: Vector-Based Feature Space Adaptation for Robust Model Fine-Tuning22 Oct 2025
- 2025Entropy Meets Importance: A Unified Head Importance-Entropy Score for Stable and Efficient Transformer Pruning10 Oct 2025
- 2025Vocabulary Customization for Efficient Domain-Specific LLM Deployment30 Sep 2025
- 2025Preserving Domain Generalization in Fine-Tuning via Joint Parameter Selection23 Aug 2025
- 2025V.I.P. : Iterative Online Preference Distillation for Efficient Video Diffusion Models5 Aug 2025
- 2025High-Layer Attention Pruning with Rescaling2 Jul 2025
- 2025Dynamic Acoustic Model Architecture Optimization in Training for ASR16 Jun 2025
- 2025Assortment of Attention Heads: Accelerating Federated PEFT with Head Pruning and Strategic Client Selection31 May 2025
- 2025AdaVid: Adaptive Video-Language Pretraining16 Apr 2025
- 2025Sparsity Outperforms Low-Rank Projections in Few-Shot Adaptation16 Apr 2025
- 2025As easy as PIE: understanding when pruning causes language models to disagree27 Mar 2025
- 2025eMoE: Task-aware Memory Efficient Mixture-of-Experts-Based (MoE) Model Inference10 Mar 2025
- 2025Unsupervised Parameter Efficient Source-free Post-pretraining28 Feb 2025
- 2025Sliding-Window Merging for Compacting Patch-Redundant Layers in LLMs26 Feb 2025
- 2025Compressing Language Models for Specialized Domains25 Feb 2025
- 2025Mamba-Shedder: Post-Transformer Compression for Efficient Selective Structured State Space Models28 Jan 2025
- 2025Merging Feed-Forward Sublayers for Compressed Transformers10 Jan 2025
- 2025CURing Large Models: Compression via CUR Decomposition8 Jan 2025
- 2024TT-MPD: Test Time Model Pruning and Distillation10 Dec 2024
- 2024BEExformer: A Fast Inferencing Binarized Transformer with Early Exits6 Dec 2024
- 2024Redundant Queries in DETR-Based 3D Detection Methods: Unnecessary and Prunable3 Dec 2024
- 2024Proactive Gradient Conflict Mitigation in Multi-Task Learning: A Sparse Training Perspective27 Nov 2024
- 2024Scalable iterative pruning of large language and vision models using block coordinate descent26 Nov 2024
- 2024DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization21 Nov 2024
- 2024Tailored-LLaMA: Optimizing Few-Shot Learning in Pruned LLaMA Models with Task-Specific Prompts24 Oct 2024
- 2024Beware of Calibration Data for Pruning Large Language Models23 Oct 2024
- 2024On Importance of Pruning and Distillation for Efficient Low Resource NLP21 Sep 2024
- 2024S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training13 Sep 2024
- 2024HESSO: Towards Automatic Efficient and User Friendly Any Neural Network Training and Pruning11 Sep 2024
- 2024Self-Masking Networks for Unsupervised Adaptation11 Sep 2024
- 2024MPruner: Optimizing Neural Network Size with CKA-Based Mutual Information Pruning24 Aug 2024
- 2024Pruning By Explaining Revisited: Optimizing Attribution Methods to Prune CNNs and Transformers22 Aug 2024
- 2024Reconstruct the Pruned Model without Any Retraining18 Jul 2024
- 2024Inference Optimization of Foundation Models on AI Accelerators12 Jul 2024
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attention2 Jul 2024
50 newest of 176 All 176 (JSON)
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracycited by 37
- 2024CHAI: Clustered Head Attention for Efficient LLM Inferencecited by 13
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inferencecited by 6
- 2024S3D: A Simple and Cost-Effective Self-Speculative Decoding Scheme for Low-Memory GPUscited by 6
- 2024Accelerating ViT Inference on FPGA through Static and Dynamic Pruningcited by 5
- 2024Optimized Speculative Sampling for GPU Hardware Acceleratorscited by 2
- 2024BEExformer: A Fast Inferencing Binarized Transformer with Early Exitscited by 0
- 2024BEExformer: A Fast Inferencing Binarized Transformer with Early Exits6 Dec 2024
- 2024Optimized Speculative Sampling for GPU Hardware Accelerators16 Jun 2024
- 2024S3D: A Simple and Cost-Effective Self-Speculative Decoding Scheme for Low-Memory GPUs30 May 2024
- 2024Accelerating ViT Inference on FPGA through Static and Dynamic Pruning21 Mar 2024
- 2024CHAI: Clustered Head Attention for Efficient LLM Inference12 Mar 2024
- 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracy20 Dec 2023
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference26 Jun 2023
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models14 Mar 2022
- 2022EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruningcited by 56
- 2023PuMer: Pruning and Merging Tokens for Efficient Vision Language Modelscited by 53
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metriccited by 30
- 2023Parameter and Computation Efficient Transfer Learning for Vision-Language Pre-trained Modelscited by 5
- 2025Sparsity Outperforms Low-Rank Projections in Few-Shot Adaptationcited by 1
- 2025Sparsity Outperforms Low-Rank Projections in Few-Shot Adaptation16 Apr 2025
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metric12 Mar 2024
- 2023Parameter and Computation Efficient Transfer Learning for Vision-Language Pre-trained Models4 Sep 2023
- 2023PuMer: Pruning and Merging Tokens for Efficient Vision Language Models27 May 2023
- 2022EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruning14 Oct 2022
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 140
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2021The Efficiency Misnomercited by 98
- 2024A Survey of Resource-efficient LLM and Multimodal Foundation Modelscited by 84
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 80
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
12 most cited of 154 All 154 (JSON)
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning27 Sep 2026
- 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning30 Aug 2026
- 2026Resource-Efficient Pruning for Transformer via Low-Rank Importance Estimation25 Aug 2026
- 2026Accelerating Vision Foundation Models with Drop-in Depthwise Convolution21 May 2026
- 2026Budgeted Attention Allocation: Cost-Conditioned Compute Control for Efficient Transformers7 May 2026
- 2026An Adapter-free Fine-tuning Approach for Tuning 3D Foundation Models24 Mar 2026
- 2026FastLightGen: Fast and Light Video Generation with Fewer Steps and Parameters2 Mar 2026
- 2026SymTorch: Symbolic Distillation of Neural Networks24 Feb 2026
- 2026Greedy-Gnorm: A Gradient Matrix Norm-Based Alternative to Attention Entropy for Head Pruning4 Feb 2026
- 2026Entropy Reveals Block Importance in Masked Self-Supervised Vision Transformers3 Feb 2026
- 2025LLMCache: Layer-Wise Caching Strategies for Accelerated Reuse in Transformer Inference18 Dec 2025
- 2025MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity17 Nov 2025
12 newest of 154 All 154 (JSON)