Z-Pruner: Post-Training Pruning of Large Language Models for Efficiency without Retraining
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have rapidly advanced in recent years, achieving remarkable performance across a wide range of natural language processing tasks. However, this progress has come at the cost of increasingly large model sizes, which pose significant challenges for deployment, scalability, and energy efficiency. To address these limitations, post-training pruning has emerged as a promising approach for reducing model size and inference latency without the need for retraining. Despite these advantages, many existing pruning methods result in substantial performance degradation or require computationally expensive fine-tuning. In this work, we introduce Z-Pruner, a novel post-training pruning method designed to induce sparsity in pretrained LLMs without any retraining. Unlike conventional approaches, Z-Pruner leverages both weight update magnitudes and activation patterns to identify and eliminate redundant parameters more effectively. Our method is model-agnostic, efficient, and easy to implement. We evaluate Z-Pruner using multiple widely-used LLM architectures, including LLaMA-2, LLaMA-3, and OPT, across a diverse set of standard language benchmarks. Experimental results demonstrate that Z-Pruner surpasses state-of-the-art pruning methods that require intensive weight updates. Specifically, Z-Pruner achieves the lowest perplexity scores and the highest overall average score for zero-shot accuracy. We have made the corresponding codes publicly available at https://github.com/sazzadadib/Z-Pruner.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 38 references that are in the map. First posted on arXiv 18 Aug 2025.
Builds on
30 of 38 references.
References · 30
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
18 more
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 807
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2018Rethinking the Value of Network Pruningcited by 599
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2020What is the State of Neural Network Pruning?cited by 583
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
- 2019Structured Pruning of Large Language Modelscited by 203
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
- 2022GPT Takes the Bar Examcited by 65
- 2023Intriguing Properties of Quantization at Scalecited by 49
- 2025LegalRAG: A Hybrid RAG System for Multilingual Legal Information Retrievalcited by 5
- 2022COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networkscited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.