GRASPrune: Global Gating for Budgeted Structured Pruning of Large Language Models
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Large language models (LLMs) are expensive to serve because model parameters, attention computation, and KV caches impose substantial memory and latency costs. We present GRASPrune, a structured pruning framework applied after pretraining that jointly prunes FFN channels and KV head groups under a single global budget. Instead of learning importance scores without constraints and applying the budget only after training, GRASPrune learns lightweight gate scores with a projected straight-through estimator that enforces a hard mask satisfying the budget at every step while keeping the backbone weights frozen. After the mask is fixed, we calibrate scaling factors on the retained units to mitigate scale mismatch caused by pruning, and fold these factors into the pruned weights to obtain a smaller dense checkpoint with no extra parameters at inference. On LLaMA-2-7B, GRASPrune removes 50% of parameters and achieves 12.18 perplexity on WikiText-2 while maintaining competitive average zero-shot accuracy on five benchmarks, using four epochs on 512 unlabeled calibration sequences on a single NVIDIA A100 80GB GPU without any full model fine-tuning.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 27 of its 38 references that are in the map. First posted on arXiv 21 Apr 2026.
Builds on
27 of 38 references.
Closest ancestors · 1
Same direction, newest first
Other references · 26
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
14 more
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 592
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2021Documenting Large Webtext Corpora: A Case Study on the Colossal Clean Crawled Corpuscited by 492
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
- 2024InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memorycited by 197
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 49
- 2024OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimizationcited by 18
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
- 2024NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models
- 2025Pruning Laws for Large Language Models
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models
- 2026POP: Prefill-Only Pruning for Efficient Large Model Inference
- 2026Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency
- 2025RAP: Runtime Adaptive Pruning for LLM Inference
- 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models