mlsanityData to 7 Oct 2026

BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation

arXiv 2402.16880 ↗First posted 18 Feb 2024cs.LG cs.AI cs.CLcited by 44

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

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  8. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  9. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  10. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
  11. 2023WizardLM: Empowering large pre-trained language models to follow complex instructionscited by 1,116
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
14 more
  1. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  2. 2022GLM-130B: An Open Bilingual Pre-trained Modelcited by 837
  3. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  4. 2023The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Onlycited by 755
  5. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  6. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  7. 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
  8. 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
  9. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
  10. 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
  11. 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Designcited by 41
  12. 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
  13. 2023A Unified Framework for Soft Threshold Pruningcited by 12
  14. 2021Lottery Jackpots Exist in Pre-trained Modelscited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 14; 2025: 22; 2026: 8.

44 papers.

Sort:

By area:

  1. 2024A Survey on Efficient Inference for Large Language Modelscited by 197
  2. 2024EfficientQAT: Efficient Quantization-Aware Training for Large Language Modelscited by 123
  3. 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
  4. 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
  5. 2024EvoPress: Accurate Dynamic Model Compression via Evolutionary Searchcited by 20
  6. 2024Beware of Calibration Data for Pruning Large Language Modelscited by 14
  7. 20252SSP: A Two-Stage Framework for Structured Pruning of LLMscited by 12
  8. 2024CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Informationcited by 11
  9. 2025Dynamic Low-Rank Sparse Adaptation for Large Language Modelscited by 10
  10. 2024Inference Optimization of Foundation Models on AI Acceleratorscited by 9
  11. 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Servingcited by 8
  12. 2026ZipServ: Fast and Memory-Efficient LLM Inference with Hardware-Aware Lossless Compressioncited by 8
32 more
  1. 2024Designing Large Foundation Models for Efficient Training and Inference: A Surveycited by 7
  2. 2025Mamba-Shedder: Post-Transformer Compression for Efficient Selective Structured State Space Modelscited by 7
  3. 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradientcited by 6
  4. 2024SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Modelscited by 5
  5. 2025Probing Neural Topology of Large Language Modelscited by 4
  6. 2025DReSS: Data-driven Regularized Structured Streamlining for Large Language Modelscited by 3
  7. 2025PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recoverycited by 3
  8. 2025Two-Stage Regularization-Based Structured Pruning for LLMscited by 3
  9. 2024Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Trainingcited by 2
  10. 2025Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMscited by 2
  11. 2025Exploring Federated Pruning for Large Language Modelscited by 2
  12. 2025PATCH: Learnable Tile-level Hybrid Sparsity for LLMscited by 2
  13. 2024LLM-Barber: Block-Aware Rebuilder for Sparsity Mask in One-Shot for Large Language Modelscited by 1
  14. 2025Safe Vision-Language Models via Unsafe Weights Manipulationcited by 1
  15. 2025STADE: Standard Deviation as a Pruning Metriccited by 1
  16. 2025Model Hemorrhage and the Robustness Limits of Large Language Modelscited by 1
  17. 2025AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Designcited by 1
  18. 2025High-Layer Attention Pruning with Rescalingcited by 1
  19. 2025A Free Lunch in LLM Compression: Revisiting Retraining after Pruningcited by 1
  20. 2025TS-PEFT: Unveiling Token-Level Redundancy in Parameter-Efficient Fine-Tuningcited by 1
  21. 2025Towards Efficient VLMs: Information-Theoretic Driven Compression via Adaptive Structural Pruningcited by 1
  22. 2024Application Specific Compression of Deep Learning Modelscited by 0
  23. 2025Beyond Uniform SVD:Dual-Level Optimization across Columns and Modules for LLM Compressioncited by 0
  24. 2025Automatic Pruning Discovery for Large Language Modelscited by 0
  25. 2025Leveraging KV Similarity for Online Structured Pruning in LLMscited by 0
  26. 2026IntraSlice: Towards High-Performance Structural Pruning with Block-Intra PCA for LLMscited by 0
  27. 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Modelscited by 0
  28. 2026SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Maskcited by 0
  29. 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Modelscited by 0
  30. 2026Prune, Update and Trim: Robust Structured Pruning for Large Language Modelscited by 0
  31. 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruningcited by 0
  32. 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruningcited by 0