BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have demonstrated outstanding performance in various tasks, such as text summarization, text question-answering, and etc. While their performance is impressive, the computational footprint due to their vast number of parameters can be prohibitive. Existing solutions such as SparseGPT and Wanda attempt to alleviate this issue through weight pruning. However, their layer-wise approach results in significant perturbation to the model's output and requires meticulous hyperparameter tuning, such as the pruning rate, which can adversely affect overall model performance. To address this, this paper introduces a novel LLM pruning technique dubbed blockwise parameter-efficient sparsity allocation (BESA) by applying a blockwise reconstruction loss. In contrast to the typical layer-wise pruning techniques, BESA is characterized by two distinctive attributes: i) it targets the overall pruning error with respect to individual transformer blocks, and ii) it allocates layer-specific sparsity in a differentiable manner, both of which ensure reduced performance degradation after pruning. Our experiments show that BESA achieves state-of-the-art performance, efficiently pruning LLMs like LLaMA1, and LLaMA2 with 7B to 70B parameters on a single A100 GPU in just five hours. Code is available at https://github.com/OpenGVLab/LLMPrune-BESA.
Key facts. Cited by 44 papers in the map (data through 7 Oct 2026). Builds on 26 of its 37 references that are in the map. First posted on arXiv 18 Feb 2024.
Builds on
26 of 37 references.
References · 26
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2023WizardLM: Empowering large pre-trained language models to follow complex instructionscited by 1,116
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
14 more
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2022GLM-130B: An Open Bilingual Pre-trained Modelcited by 837
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Onlycited by 755
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
- 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
- 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
- 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Designcited by 41
- 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
- 2023A Unified Framework for Soft Threshold Pruningcited by 12
- 2021Lottery Jackpots Exist in Pre-trained Modelscited by 10
Built on by
Citing papers per year: 2024: 14; 2025: 22; 2026: 8.
44 papers.
Sort:
By area:
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2024EfficientQAT: Efficient Quantization-Aware Training for Large Language Modelscited by 123
- 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
- 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
- 2024EvoPress: Accurate Dynamic Model Compression via Evolutionary Searchcited by 20
- 2024Beware of Calibration Data for Pruning Large Language Modelscited by 14
- 20252SSP: A Two-Stage Framework for Structured Pruning of LLMscited by 12
- 2024CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Informationcited by 11
- 2025Dynamic Low-Rank Sparse Adaptation for Large Language Modelscited by 10
- 2024Inference Optimization of Foundation Models on AI Acceleratorscited by 9
- 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Servingcited by 8
- 2026ZipServ: Fast and Memory-Efficient LLM Inference with Hardware-Aware Lossless Compressioncited by 8
32 more
- 2024Designing Large Foundation Models for Efficient Training and Inference: A Surveycited by 7
- 2025Mamba-Shedder: Post-Transformer Compression for Efficient Selective Structured State Space Modelscited by 7
- 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradientcited by 6
- 2024SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Modelscited by 5
- 2025Probing Neural Topology of Large Language Modelscited by 4
- 2025DReSS: Data-driven Regularized Structured Streamlining for Large Language Modelscited by 3
- 2025PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recoverycited by 3
- 2025Two-Stage Regularization-Based Structured Pruning for LLMscited by 3
- 2024Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Trainingcited by 2
- 2025Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMscited by 2
- 2025Exploring Federated Pruning for Large Language Modelscited by 2
- 2025PATCH: Learnable Tile-level Hybrid Sparsity for LLMscited by 2
- 2024LLM-Barber: Block-Aware Rebuilder for Sparsity Mask in One-Shot for Large Language Modelscited by 1
- 2025Safe Vision-Language Models via Unsafe Weights Manipulationcited by 1
- 2025STADE: Standard Deviation as a Pruning Metriccited by 1
- 2025Model Hemorrhage and the Robustness Limits of Large Language Modelscited by 1
- 2025AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Designcited by 1
- 2025High-Layer Attention Pruning with Rescalingcited by 1
- 2025A Free Lunch in LLM Compression: Revisiting Retraining after Pruningcited by 1
- 2025TS-PEFT: Unveiling Token-Level Redundancy in Parameter-Efficient Fine-Tuningcited by 1
- 2025Towards Efficient VLMs: Information-Theoretic Driven Compression via Adaptive Structural Pruningcited by 1
- 2024Application Specific Compression of Deep Learning Modelscited by 0
- 2025Beyond Uniform SVD:Dual-Level Optimization across Columns and Modules for LLM Compressioncited by 0
- 2025Automatic Pruning Discovery for Large Language Modelscited by 0
- 2025Leveraging KV Similarity for Online Structured Pruning in LLMscited by 0
- 2026IntraSlice: Towards High-Performance Structural Pruning with Block-Intra PCA for LLMscited by 0
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Modelscited by 0
- 2026SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Maskcited by 0
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Modelscited by 0
- 2026Prune, Update and Trim: Robust Structured Pruning for Large Language Modelscited by 0
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruningcited by 0
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruningcited by 0
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning27 Sep 2026
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning3 Aug 2026
- 2026Prune, Update and Trim: Robust Structured Pruning for Large Language Models18 May 2026
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Models9 May 2026
- 2026SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Mask7 May 2026
- 2026ZipServ: Fast and Memory-Efficient LLM Inference with Hardware-Aware Lossless Compression18 Mar 2026
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models6 Feb 2026
- 2026IntraSlice: Towards High-Performance Structural Pruning with Block-Intra PCA for LLMs2 Feb 2026
- 2025Leveraging KV Similarity for Online Structured Pruning in LLMs8 Dec 2025
- 2025Towards Efficient VLMs: Information-Theoretic Driven Compression via Adaptive Structural Pruning24 Nov 2025
- 2025TS-PEFT: Unveiling Token-Level Redundancy in Parameter-Efficient Fine-Tuning20 Nov 2025
- 2025Automatic Pruning Discovery for Large Language Models19 Nov 2025
32 more
- 2025Beyond Uniform SVD:Dual-Level Optimization across Columns and Modules for LLM Compression22 Oct 2025
- 2025A Free Lunch in LLM Compression: Revisiting Retraining after Pruning16 Oct 2025
- 2025PATCH: Learnable Tile-level Hybrid Sparsity for LLMs27 Sep 2025
- 2025High-Layer Attention Pruning with Rescaling2 Jul 2025
- 2025Probing Neural Topology of Large Language Models1 Jun 2025
- 2025Two-Stage Regularization-Based Structured Pruning for LLMs23 May 2025
- 2025Exploring Federated Pruning for Large Language Models19 May 2025
- 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Serving14 Apr 2025
- 2025AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Design7 Apr 2025
- 2025Model Hemorrhage and the Robustness Limits of Large Language Models31 Mar 2025
- 2025STADE: Standard Deviation as a Pruning Metric28 Mar 2025
- 2025Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMs24 Mar 2025
- 2025Safe Vision-Language Models via Unsafe Weights Manipulation14 Mar 2025
- 2025Dynamic Low-Rank Sparse Adaptation for Large Language Models20 Feb 2025
- 2025PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recovery18 Feb 2025
- 2025DReSS: Data-driven Regularized Structured Streamlining for Large Language Models29 Jan 2025
- 20252SSP: A Two-Stage Framework for Structured Pruning of LLMs29 Jan 2025
- 2025Mamba-Shedder: Post-Transformer Compression for Efficient Selective Structured State Space Models28 Jan 2025
- 2024Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Training11 Nov 2024
- 2024Beware of Calibration Data for Pruning Large Language Models23 Oct 2024
- 2024EvoPress: Accurate Dynamic Model Compression via Evolutionary Search18 Oct 2024
- 2024SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Models1 Oct 2024
- 2024CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Information20 Sep 2024
- 2024Application Specific Compression of Deep Learning Models9 Sep 2024
- 2024Designing Large Foundation Models for Efficient Training and Inference: A Survey3 Sep 2024
- 2024LLM-Barber: Block-Aware Rebuilder for Sparsity Mask in One-Shot for Large Language Models20 Aug 2024
- 2024Inference Optimization of Foundation Models on AI Accelerators12 Jul 2024
- 2024EfficientQAT: Efficient Quantization-Aware Training for Large Language Models10 Jul 2024
- 2024BlockPruner: Fine-grained Pruning for Large Language Models15 Jun 2024
- 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient15 Jun 2024
- 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models5 Jun 2024
- 2024A Survey on Efficient Inference for Large Language Models22 Apr 2024
- 2024EfficientQAT: Efficient Quantization-Aware Training for Large Language Modelscited by 123
- 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
- 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
- 2024EvoPress: Accurate Dynamic Model Compression via Evolutionary Searchcited by 20
- 2024Beware of Calibration Data for Pruning Large Language Modelscited by 14
- 20252SSP: A Two-Stage Framework for Structured Pruning of LLMscited by 12
- 2024CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Informationcited by 11
- 2025Dynamic Low-Rank Sparse Adaptation for Large Language Modelscited by 10
- 2024Inference Optimization of Foundation Models on AI Acceleratorscited by 9
- 2024Designing Large Foundation Models for Efficient Training and Inference: A Surveycited by 7
- 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradientcited by 6
- 2024SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Modelscited by 5
12 most cited of 37 All 37 (JSON)
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning27 Sep 2026
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning3 Aug 2026
- 2026Prune, Update and Trim: Robust Structured Pruning for Large Language Models18 May 2026
- 2026SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Mask7 May 2026
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models6 Feb 2026
- 2026IntraSlice: Towards High-Performance Structural Pruning with Block-Intra PCA for LLMs2 Feb 2026
- 2025Leveraging KV Similarity for Online Structured Pruning in LLMs8 Dec 2025
- 2025TS-PEFT: Unveiling Token-Level Redundancy in Parameter-Efficient Fine-Tuning20 Nov 2025
- 2025Automatic Pruning Discovery for Large Language Models19 Nov 2025
- 2025Beyond Uniform SVD:Dual-Level Optimization across Columns and Modules for LLM Compression22 Oct 2025
- 2025A Free Lunch in LLM Compression: Revisiting Retraining after Pruning16 Oct 2025
- 2025PATCH: Learnable Tile-level Hybrid Sparsity for LLMs27 Sep 2025
12 newest of 37 All 37 (JSON)