From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Structured pruning is a practical approach to deploying large language models (LLMs) efficiently, as it yields compact, hardware-friendly architectures. However, the dominant local paradigm is task-agnostic: by optimizing layer-wise reconstruction rather than task objectives, it tends to preserve perplexity or generic zero-shot behavior but fails to capitalize on modest task-specific calibration signals, often yielding limited downstream gains. We revisit global structured pruning and present GISP, Global Iterative Structured Pruning, a post-training method that removes attention heads and MLP channels using first-order, loss-based important scores aggregated at the structure level with block-wise normalization. Built on this global importance metric, GISP adopts an iterative schedule, rather than one-shot pruning, stabilizes accuracy at higher sparsity, and mitigates perplexity collapse without requiring intermediate fine-tuning. Importantly, the iterative pruning forms nested subnetworks that support a ''prune-once, deploy-many'' workflow. Furthermore, GISP defines structural importance directly with respect to a target loss, making it easy to adapt pruning to task-specific objectives. In this work, we use perplexity for language modeling and a margin-based objective for decision-style tasks. Extensive experiments show that across Llama2-7B/13B, Llama3-8B, and Mistral-0.3-7B, GISP consistently lowers WikiText-2 perplexity and improves on downstream accuracy, with especially strong gains at 40-50% sparsity; on DeepSeek-R1-Distill-Llama-3-8B and Qwen3-8B with GSM8K, task-aligned calibration substantially boosts exact-match accuracy. The implementation is available at https://github.com/uncc-efficient-ai/GISP.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 27 of its 44 references that are in the map. First posted on arXiv 20 Oct 2025.
Builds on
27 of 44 references.
References · 27
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 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
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
15 more
- 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
- 2020What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Examscited by 1,324
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2020What is the State of Neural Network Pruning?cited by 578
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Modelscited by 456
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2021Convolutional Neural Network Pruning with Structural Redundancy Reductioncited by 73
- 2021Global Vision Transformer Pruning with Hessian-Aware Saliencycited by 69
- 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26
- 2023Pruning Deep Neural Networks from a Sparsity Perspectivecited by 25
- 2024SparseLLM: Towards Global Pruning for Pre-trained Language Modelscited by 23
Built on by
Citing papers per year: 2025: 1; 2026: 4.
5 papers.
- 2025Think Before You Prune: Self-Reflective Structured Pruning for Reasoning Language Modelscited by 4
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Modelscited by 0
- 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruningcited by 0
- 2026When Can Attention Heads Be Statically Defined?cited by 0
- 2026Learning Functional Subspaces for Neural Network Compressioncited by 0
- 2026Learning Functional Subspaces for Neural Network Compression30 Sep 2026
- 2026When Can Attention Heads Be Statically Defined?28 Sep 2026
- 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning30 Aug 2026
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Models9 May 2026
- 2025Think Before You Prune: Self-Reflective Structured Pruning for Reasoning Language Models1 Dec 2025
Similar, not cited
Close in wording, no citation either way
- 2026GRASPrune: Global Gating for Budgeted Structured Pruning of Large Language Models
- 2025Pruning Laws for Large Language Models
- 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models
- 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methods
- 2025Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information
- 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models
- 2026Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency