mlsanityData to 14 Oct 2026

SlimLLM: Accurate Structured Pruning for Large Language Models

arXiv 2505.22689 ↗First posted 28 May 2025cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

Large language models(LLMs) have garnered significant attention and demonstrated impressive capabilities in a wide range of applications. However, due to their enormous computational costs, the deployment and application of LLMs are often severely limited. To address this issue, structured pruning is an effective solution to compress the parameters of LLMs. Determining the importance of each sub-module in LLMs and minimizing performance loss are critical issues that need to be carefully addressed in structured pruning. In this paper, we propose an effective and fast structured pruning method named SlimLLM for large language models. For channel and attention head pruning, we evaluate the importance based on the entire channel or head, rather than merely aggregating the importance of individual elements within a sub-module. This approach enables a more holistic consideration of the interdependence among elements within the sub-module. In addition, we design a simple linear regression strategy for the output matrix to quickly recover performance. We also propose layer-based importance ratio to determine the pruning ratio for each layer. Based on the LLaMA benchmark results, our SlimLLM outperforms other methods and achieves state-of-the-art performance.

Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 28 May 2025.

Builds on

24 of 33 references.

References · 24

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  5. 2016Pointer Sentinel Mixture Modelscited by 3,096
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  7. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  8. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  9. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  10. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
  11. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  12. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
12 more
  1. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  2. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  3. 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
  4. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  5. 2022Language model compression with weighted low-rank factorizationcited by 195
  6. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
  7. 2015Structured Pruning of Deep Convolutional Neural Networkscited by 149
  8. 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
  9. 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
  10. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  11. 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 44
  12. 2023LoRAShear: Efficient Large Language Model Structured Pruning and Knowledge Recoverycited by 38

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 17.

18 papers.

Sort:

By area:

  1. 2026Zero Sum SVD: Balancing Loss Sensitivity for Low Rank LLM Compressioncited by 8
  2. 2026FastAV: Efficient Token Pruning for Audio-Visual Large Language Model Inferencecited by 7
  3. 2026Deterministic Differentiable Structured Pruning for Large Language Modelscited by 2
  4. 2026Swift-SVD: Theoretical Optimality Meets Practical Efficiency in Low-Rank LLM Compressioncited by 2
  5. 2026It Takes a MAESTRO To Prune Bad Expertscited by 2
  6. 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMscited by 2
  7. 2026LLM Compression by Block Removal with Constrained Binary Optimizationcited by 1
  8. 2026Supernodes and Halos: Loss-Critical Hubs in LLM Feed-Forward Layerscited by 1
  9. 2026Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compressioncited by 1
  10. 2026Beyond Scalar Sensitivity: Activation-Aware Mixed-Precision LLM Quantization with Cross-Layer Refinementcited by 1
  11. 2025COMPACT: Common-token Optimized Model Pruning Across Channels and Tokenscited by 0
  12. 2026Compressing LLMs with MoP: Mixture of Prunerscited by 0
6 more
  1. 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Modelscited by 0
  2. 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimizationcited by 0
  3. 2026SHIFT-LLM: Distribution Shift Correction in Depth-Pruned LLMscited by 0
  4. 2026When Pruning Meets Interpretability: Preserving Sparse Autoencoder Robustness in LLMscited by 0
  5. 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruningcited by 0
  6. 2026ReCal: Calibrating Structured Pruning for On-Policy Distillation Recoverycited by 0