The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Transformer-based language models have become a key building block for natural language processing. While these models are extremely accurate, they can be too large and computationally intensive to run on standard deployments. A variety of compression methods, including distillation, quantization, structured and unstructured pruning are known to decrease model size and increase inference speed, with low accuracy loss. In this context, this paper's contributions are two-fold. We perform an in-depth study of the accuracy-compression trade-off for unstructured weight pruning of BERT models. We introduce Optimal BERT Surgeon (oBERT), an efficient and accurate weight pruning method based on approximate second-order information, which we show to yield state-of-the-art results in both stages of language tasks: pre-training and fine-tuning. Specifically, oBERT extends existing work on unstructured second-order pruning by allowing for pruning blocks of weights, and by being applicable at the BERT scale. Second, we investigate the impact of this pruning method when compounding compression approaches to obtain highly compressed but accurate models for deployment on edge devices. These models significantly push boundaries of the current state-of-the-art sparse BERT models with respect to all metrics: model size, inference speed and task accuracy. For example, relative to the dense BERT-base, we obtain 10x model size compression (in MB) with < 1% accuracy drop, 10x CPU-inference speedup with < 2% accuracy drop, and 29x CPU-inference speedup with < 7.5% accuracy drop. Our code, fully integrated with Transformers and SparseML, is available at https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT.
Key facts. Cited by 115 papers in the map (data through 7 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 39 of its 56 references that are in the map. First posted on arXiv 14 Mar 2022.
Builds on
39 of 56 references.
References · 39
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 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
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,041
27 more
- 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
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2022Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Modelcited by 557
- 2021Datasets: A Community Library for Natural Language Processingcited by 526
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
- 2019Q8BERT: Quantized 8Bit BERTcited by 296
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2021Block Pruning For Faster Transformerscited by 176
- 2020Training with Quantization Noise for Extreme Model Compressioncited by 145
- 2020TernaryBERT: Distillation-aware Ultra-low Bit BERTcited by 145
- 2021Learned Token Pruning for Transformerscited by 138
- 2019Well-Read Students Learn Better: On the Importance of Pre-training Compact Modelscited by 118
- 2016Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1cited by 102
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2021Hessian-Aware Pruning and Optimal Neural Implantcited by 43
- 2021Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigmcited by 40
- 2020Optimal Subarchitecture Extraction For BERTcited by 9
- 2020Undivided Attention: Are Intermediate Layers Necessary for BERT?cited by 6
Built on by
Citing papers per year: 2022: 11; 2023: 41; 2024: 32; 2025: 24; 2026: 7.
115 papers.
Sort:
By area:
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 564
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2023Speculative Decoding with Big Little Decodercited by 163
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
38 more
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
- 2024RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptationcited by 48
- 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 46
- 2024MoDeGPT: Modular Decomposition for Large Language Model Compressioncited by 45
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
- 2023QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Modelscited by 42
- 2023Scaling Laws for Sparsely-Connected Foundation Modelscited by 41
- 2024CATS: Contextually-Aware Thresholding for Sparsity in Large Language Modelscited by 41
- 2023Predictive Pipelined Decoding: A Compute-Latency Trade-off for Exact LLM Decodingcited by 40
- 2023The LLM Surgeoncited by 36
- 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
- 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 35
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruningcited by 30
- 2025GuidedQuant: Large Language Model Quantization via Exploiting End Loss Guidancecited by 28
- 2023Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!cited by 27
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
- 2024LeanQuant: Accurate and Scalable Large Language Model Quantization with Loss-error-aware Gridcited by 20
- 2024ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Modelscited by 18
- 2023One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Modelscited by 16
- 2024Effective Interplay between Sparsity and Quantization: From Theory to Practicecited by 16
- 2025DarwinLM: Evolutionary Structured Pruning of Large Language Modelscited by 16
- 2024A Comprehensive Survey of Compression Algorithms for Language Modelscited by 15
- 2024LPViT: Low-Power Semi-structured Pruning for Vision Transformerscited by 15
- 2022GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methodscited by 14
- 2023Sparse Fine-tuning for Inference Acceleration of Large Language Modelscited by 14
- 2022Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruningcited by 13
- 2023VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Corescited by 13
- 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
- 2024CHAI: Clustered Head Attention for Efficient LLM Inferencecited by 13
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruningcited by 13
- 2023SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networkscited by 12
- 2023PDP: Parameter-free Differentiable Pruning is All You Needcited by 12
- 2024LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Modelscited by 12
- 2023Bias in Pruned Vision Models: In-Depth Analysis and Countermeasurescited by 11
50 most cited of 115 All 115 (JSON)
- 2026SVD-Surgeon: Optimal Singular-Value Surgery for Large Language Model Compression22 Jun 2026
- 2026Exploiting weight-space symmetries for approximating curvature30 May 2026
- 2026Neural Activation Patterns Across Language Model Architectures: A Comprehensive Analysis of Cognitive Task Performance14 May 2026
- 2026Supernodes and Halos: Loss-Critical Hubs in LLM Feed-Forward Layers26 Apr 2026
- 2026Prune-then-Quantize or Quantize-then-Prune? Understanding the Impact of Compression Order in Joint Model Compression19 Mar 2026
- 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometry20 Feb 2026
- 2026LLM Compression by Block Removal with Constrained Binary Optimization29 Jan 2026
- 2025ZK-APEX: Zero-Knowledge Approximate Personalized Unlearning with Executable Proofs9 Dec 2025
- 2025Theoretical Compression Bounds for Wide Multilayer Perceptrons6 Dec 2025
- 2025VLM in a flash: I/O-Efficient Sparsification of Vision-Language Model via Neuron Chunking24 Nov 2025
- 2025Pluggable Pruning with Contiguous Layer Distillation for Diffusion Transformers20 Nov 2025
- 2025Ensembling Pruned Attention Heads For Uncertainty-Aware Efficient Transformers21 Oct 2025
38 more
- 2025Entropy Meets Importance: A Unified Head Importance-Entropy Score for Stable and Efficient Transformer Pruning10 Oct 2025
- 2025Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation30 Sep 2025
- 2025MGAA: Multi-Granular Adaptive Allocation fof Low-Rank Compression of LLMs4 Jul 2025
- 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformers3 Jul 2025
- 2025Verifiable Unlearning on Edge24 Jun 2025
- 2025HessFormer: Hessians at Foundation Scale16 May 2025
- 2025GuidedQuant: Large Language Model Quantization via Exploiting End Loss Guidance11 May 2025
- 2025Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models3 May 2025
- 2025FineScope : SAE-guided Data Selection Enables Domain Specific LLM Pruning and Finetuning1 May 2025
- 2025Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs15 Mar 2025
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decoding13 Mar 2025
- 2025Swallowing the Poison Pills: Insights from Vulnerability Disparity Among LLMs23 Feb 2025
- 2025BeamLoRA: Beam-Constraint Low-Rank Adaptation19 Feb 2025
- 2025DarwinLM: Evolutionary Structured Pruning of Large Language Models11 Feb 2025
- 2025Do we really have to filter out random noise in pre-training data for language models?10 Feb 2025
- 2025HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs2 Feb 2025
- 2025DReSS: Data-driven Regularized Structured Streamlining for Large Language Models29 Jan 2025
- 2025ToMoE: Converting Dense Large Language Models to Mixture-of-Experts through Dynamic Structural Pruning25 Jan 2025
- 2025Deriving Coding-Specific Sub-Models from LLMs using Resource-Efficient Pruning9 Jan 2025
- 2024Efficient Model Compression Techniques with FishLeg3 Dec 2024
- 2024Scalable iterative pruning of large language and vision models using block coordinate descent26 Nov 2024
- 2024From Pruning to Grafting: Dynamic Knowledge Redistribution via Learnable Layer Fusion21 Nov 2024
- 2024Magnitude Pruning of Large Pretrained Transformer Models with a Mixture Gaussian Prior1 Nov 2024
- 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models14 Oct 2024
- 2024Mitigating Memorization In Language Models3 Oct 2024
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep 2024
- 2024MoDeGPT: Modular Decomposition for Large Language Model Compression19 Aug 2024
- 2024Toward Efficient Permutation for Hierarchical N:M Sparsity on GPUs30 Jul 2024
- 2024Reconstruct the Pruned Model without Any Retraining18 Jul 2024
- 2024MINI-LLM: Memory-Efficient Structured Pruning for Large Language Models16 Jul 2024
- 2024LeanQuant: Accurate and Scalable Large Language Model Quantization with Loss-error-aware Grid14 Jul 2024
- 2024DM3D: Distortion-Minimized Weight Pruning for Lossless 3D Object Detection2 Jul 2024
- 2024LPViT: Low-Power Semi-structured Pruning for Vision Transformers2 Jul 2024
- 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient15 Jun 2024
- 2024ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models12 Jun 2024
- 2024Evaluating Zero-Shot Long-Context LLM Compression10 Jun 2024
- 2024Effective Interplay between Sparsity and Quantization: From Theory to Practice31 May 2024
- 2024STAT: Shrinking Transformers After Training29 May 2024
50 newest of 115 All 115 (JSON)
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2023Speculative Decoding with Big Little Decodercited by 163
- 2023Sparse Fine-tuning for Inference Acceleration of Large Language Modelscited by 14
- 2024CHAI: Clustered Head Attention for Efficient LLM Inferencecited by 13
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decodingcited by 9
- 2023Training-Free Acceleration of ViTs with Delayed Spatial Mergingcited by 4
- 2024DE3-BERT: Distance-Enhanced Early Exiting for BERT based on Prototypical Networkscited by 3
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decoding13 Mar 2025
- 2024A Survey on Efficient Inference for Large Language Models22 Apr 2024
- 2024CHAI: Clustered Head Attention for Efficient LLM Inference12 Mar 2024
- 2024DE3-BERT: Distance-Enhanced Early Exiting for BERT based on Prototypical Networks3 Feb 2024
- 2023Sparse Fine-tuning for Inference Acceleration of Large Language Models10 Oct 2023
- 2023Training-Free Acceleration of ViTs with Delayed Spatial Merging4 Mar 2023
- 2023Speculative Decoding with Big Little Decoder15 Feb 2023
- 2023QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Modelscited by 42
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruningcited by 30
- 2025ToMoE: Converting Dense Large Language Models to Mixture-of-Experts through Dynamic Structural Pruningcited by 10
- 2025HessFormer: Hessians at Foundation Scalecited by 4
- 2025HessFormer: Hessians at Foundation Scale16 May 2025
- 2025ToMoE: Converting Dense Large Language Models to Mixture-of-Experts through Dynamic Structural Pruning25 Jan 2025
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep 2024
- 2023QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Models25 Oct 2023
- 2025ZK-APEX: Zero-Knowledge Approximate Personalized Unlearning with Executable Proofs9 Dec 2025
- 2025Verifiable Unlearning on Edge24 Jun 2025
- 2025Swallowing the Poison Pills: Insights from Vulnerability Disparity Among LLMs23 Feb 2025
- 2024Mitigating Memorization In Language Models3 Oct 2024
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
12 most cited of 96 All 96 (JSON)
- 2026SVD-Surgeon: Optimal Singular-Value Surgery for Large Language Model Compression22 Jun 2026
- 2026Exploiting weight-space symmetries for approximating curvature30 May 2026
- 2026Neural Activation Patterns Across Language Model Architectures: A Comprehensive Analysis of Cognitive Task Performance14 May 2026
- 2026Supernodes and Halos: Loss-Critical Hubs in LLM Feed-Forward Layers26 Apr 2026
- 2026Prune-then-Quantize or Quantize-then-Prune? Understanding the Impact of Compression Order in Joint Model Compression19 Mar 2026
- 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometry20 Feb 2026
- 2026LLM Compression by Block Removal with Constrained Binary Optimization29 Jan 2026
- 2025Theoretical Compression Bounds for Wide Multilayer Perceptrons6 Dec 2025
- 2025Ensembling Pruned Attention Heads For Uncertainty-Aware Efficient Transformers21 Oct 2025
- 2025Entropy Meets Importance: A Unified Head Importance-Entropy Score for Stable and Efficient Transformer Pruning10 Oct 2025
- 2025Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation30 Sep 2025
- 2025MGAA: Multi-Granular Adaptive Allocation fof Low-Rank Compression of LLMs4 Jul 2025
12 newest of 96 All 96 (JSON)
Similar, not cited
Close in wording, no citation either way
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference
- 2025Pruning Laws for Large Language Models
- 2023Just CHOP: Embarrassingly Simple LLM Compression
- 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models
- 2022Token Dropping for Efficient BERT Pretraining
- 2021Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruning
- 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models