To prune, or not to prune: exploring the efficacy of pruning for model compression
Not on the map. Why?
Abstract (arXiv)
Model pruning seeks to induce sparsity in a deep neural network's various connection matrices, thereby reducing the number of nonzero-valued parameters in the model. Recent reports (Han et al., 2015; Narang et al., 2017) prune deep networks at the cost of only a marginal loss in accuracy and achieve a sizable reduction in model size. This hints at the possibility that the baseline models in these experiments are perhaps severely over-parameterized at the outset and a viable alternative for model compression might be to simply reduce the number of hidden units while maintaining the model's dense connection structure, exposing a similar trade-off in model size and accuracy. We investigate these two distinct paths for model compression within the context of energy-efficient inference in resource-constrained environments and propose a new gradual pruning technique that is simple and straightforward to apply across a variety of models/datasets with minimal tuning and can be seamlessly incorporated within the training process. We compare the accuracy of large, but pruned models (large-sparse) and their smaller, but dense (small-dense) counterparts with identical memory footprint. Across a broad range of neural network architectures (deep CNNs, stacked LSTM, and seq2seq LSTM models), we find large-sparse models to consistently outperform small-dense models and achieve up to 10x reduction in number of non-zero parameters with minimal loss in accuracy.
Key facts. Cited by 596 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 131; 2022: 120; 2023: 116; 2024: 110; 2025: 83; 2026: 36.
596 papers.
Sort:
By area:
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
- 2023Ego-Exo4D: Understanding Skilled Human Activity from First- and Third-Person Perspectivescited by 477
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 153
38 more
- 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 145
- 2022Overcoming Oscillations in Quantization-Aware Trainingcited by 116
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 104
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2023AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal Contrastive Learningcited by 101
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2022LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Modelscited by 98
- 2021QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuitscited by 97
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
- 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2024DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Samplingcited by 77
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
- 2022PD-Quant: Post-Training Quantization based on Prediction Difference Metriccited by 73
- 2023Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inferencecited by 69
- 2021SoK: How Robust is Image Classification Deep Neural Network Watermarking? (Extended Version)cited by 67
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2022A Comprehensive Survey on Model Quantization for Deep Neural Networks in Image Classificationcited by 64
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2021A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustnesscited by 62
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
- 2021A Comprehensive Survey on Hardware-Aware Neural Architecture Searchcited by 60
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
- 2021TT-Rec: Tensor Train Compression for Deep Learning Recommendation Modelscited by 58
- 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 58
- 2022Fingerprinting Deep Neural Networks Globally via Universal Adversarial Perturbationscited by 58
- 2025RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMscited by 58
- 2021CDFI: Compression-Driven Network Design for Frame Interpolationcited by 55
- 2021Recent Advances of Continual Learning in Computer Vision: An Overviewcited by 55
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 55
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compressioncited by 54
50 most cited of 596 All 596 (JSON)
- 2026Universal Cross-Prompt Adversarial Attacks on Promptable Concept Segmentation30 Sep 2026
- 2026Input-Layer Starvation: Why Per-Layer Pruning Breaks IoT Intrusion Detectors25 Sep 2026
- 2026Dense Structural Compression of Transformers via Gauge-Correct Channel Removal7 Sep 2026
- 2026Deep Microcompression: Structured Pruning and Bit-packed Quantization for Microcontrollers4 Sep 2026
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategy4 Sep 2026
- 2026LegoLM: Structured Weight Sharing for Large Language Models9 Aug 2026
- 2026BnBERT-iPET: Sparse Few-Shot Language Modeling for Bengali via Lottery Ticket Pruning5 Aug 2026
- 2026Lottery Tickets Are Not Deployment Tickets29 Jul 2026
- 2026Depth-Aware Sensitivity Analysis of Mixture-of-Experts Models via Magnitude-Based Expert Masking25 Jun 2026
- 2026Hybrid Compression: Integrating Pruning and Quantization for Optimized Neural Networks22 Jun 2026
- 2026SCENIC: Semantic-Conditioned Edge-Aware Neural Framework for Structured IoT Command Generation21 Jun 2026
- 2026Squeeze-Release: Iterative Pruning with Exact Structural Minimization12 Jun 2026
38 more
- 2026Efficiency-Performance Trade-offs in Neural Speaker Diarization via Structured Pruning and Low-Bit Quantization12 Jun 2026
- 2026Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning10 Jun 2026
- 2026T2S: A Rehearsal-Based Approach for Extraction-Resistant Model Watermarking10 Jun 2026
- 2026MuCRASP: Multimodal Chain-of-thought Reasoning aware Structured Pruning25 May 2026
- 2026Prune, Update and Trim: Robust Structured Pruning for Large Language Models18 May 2026
- 2026Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers8 May 2026
- 2026Auto-FlexSwitch: Efficient Dynamic Model Merging via Learnable Task Vector Compression30 Apr 2026
- 2026Engineering Resource-constrained Software Systems with DNN Components: a Concept-based Pruning Approach11 Apr 2026
- 2026PruneFuse: Efficient Data Selection via Weight Pruning and Network Fusion27 Mar 2026
- 2026Pruning-induced phases in fully-connected neural networks: the eumentia, the dementia, and the amentia12 Mar 2026
- 2026Uncovering a Winning Lottery Ticket with Continuously Relaxed Bernoulli Gates9 Mar 2026
- 2026RNM-TD3: N:M Semi-structured Sparse Reinforcement Learning From Scratch16 Feb 2026
- 2026MAUNet-Light: A Concise MAUNet Architecture for Bias Correction and Downscaling of Precipitation Estimates13 Feb 2026
- 2026Zero-Sacrifice Persistent-Robustness Adversarial Defense for Pre-Trained Encoders10 Feb 2026
- 2026Sparsity-Aware Evolution for Model Merging9 Feb 2026
- 2026Efficient Post-Training Pruning of Large Language Models with Statistical Correction7 Feb 2026
- 2026It's Not a Lottery, It's a Race: Understanding How Gradient Descent Adapts the Network's Capacity to the Task4 Feb 2026
- 2026ACL: Aligned Contrastive Learning Improves BERT and Multi-exit BERT Fine-tuning3 Feb 2026
- 2026AIRE-Prune: Asymptotic Impulse-Response Energy for State Pruning in State Space Models31 Jan 2026
- 2026Performance and Complexity Trade-off Optimization of Speech Models During Training20 Jan 2026
- 2026Using deep learning for predicting cleansing quality of colon capsule endoscopy images19 Jan 2026
- 2026Enhancing LUT-based Deep Neural Networks Inference through Architecture and Connectivity Optimization14 Jan 2026
- 2026TAP-ViTs: Task-Adaptive Pruning for On-Device Deployment of Vision Transformers5 Jan 2026
- 2026Meta-Learning Guided Pruning for Few-Shot Plant Pathology on Edge Devices5 Jan 2026
- 2025Evaluating the Impact of Compression Techniques on the Robustness of CNNs under Natural Corruptions31 Dec 2025
- 2025FPGA Co-Design for Efficient N:M Sparse and Quantized Model Inference31 Dec 2025
- 2025Tiny, On-Device Decision Makers with the MiniConv Library17 Dec 2025
- 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models21 Nov 2025
- 2025Weight-sparse transformers have interpretable circuits17 Nov 2025
- 2025Robust Client-Server Watermarking for Split Federated Learning17 Nov 2025
- 2025Building Egocentric Procedural AI Assistant: Methods, Benchmarks, and Challenges17 Nov 2025
- 2025BitSnap: Checkpoint Sparsification and Quantization in LLM Training15 Nov 2025
- 2025Hardware-Aware YOLO Compression for Low-Power Edge AI on STM32U5 for Weeds Detection in Digital Agriculture11 Nov 2025
- 2025GD-FPS: Growth-Driven Feedforward Parameter Selection for Efficient Fine-Tuning31 Oct 2025
- 2025Hankel Singular Value Regularization for Highly Compressible State Space Models27 Oct 2025
- 2025Elastic ViTs from Pretrained Models without Retraining20 Oct 2025
- 2025SQS: Bayesian DNN Compression through Sparse Quantized Sub-distributions10 Oct 2025
- 2025Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Experts9 Oct 2025
50 newest of 596 All 596 (JSON)
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 104
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Expertscited by 36
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniquescited by 24
- 2025EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Modelscited by 18
- 2025Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Expertscited by 1
- 2022Towards Lightweight Neural Animation : Exploration of Neural Network Pruning in Mixture of Experts-based Animation Modelscited by 0
- 2026Depth-Aware Sensitivity Analysis of Mixture-of-Experts Models via Magnitude-Based Expert Maskingcited by 0
- 2026Depth-Aware Sensitivity Analysis of Mixture-of-Experts Models via Magnitude-Based Expert Masking25 Jun 2026
- 2025Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Experts9 Oct 2025
- 2025EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Models3 Aug 2025
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts12 Jul 2024
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques4 Jun 2024
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy2 Oct 2023
- 2022Towards Lightweight Neural Animation : Exploration of Neural Network Pruning in Mixture of Experts-based Animation Models11 Jan 2022
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2025BEEM: Boosting Performance of Early Exit DNNs using Multi-Exit Classifiers as Expertscited by 6
- 2024Distributed Inference on Mobile Edge and Cloud: An Early Exit based Clustering Approachcited by 3
- 2023SparseByteNN: A Novel Mobile Inference Acceleration Framework Based on Fine-Grained Group Sparsitycited by 0
- 2025Balanced and Elastic End-to-end Training of Dynamic LLMscited by 0
- 2025Sparsified State-Space Models are Efficient Highway Networkscited by 0
- 2025Sparsified State-Space Models are Efficient Highway Networks27 May 2025
- 2025Balanced and Elastic End-to-end Training of Dynamic LLMs20 May 2025
- 2025BEEM: Boosting Performance of Early Exit DNNs using Multi-Exit Classifiers as Experts2 Feb 2025
- 2024Distributed Inference on Mobile Edge and Cloud: An Early Exit based Clustering Approach6 Oct 2024
- 2023SparseByteNN: A Novel Mobile Inference Acceleration Framework Based on Fine-Grained Group Sparsity30 Oct 2023
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models14 Mar 2022
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metriccited by 30
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruningcited by 13
- 2025TAMP: Token-Adaptive Layerwise Pruning in Multimodal Large Language Modelscited by 9
- 2025Building Egocentric Procedural AI Assistant: Methods, Benchmarks, and Challengescited by 5
- 2025Building Egocentric Procedural AI Assistant: Methods, Benchmarks, and Challenges17 Nov 2025
- 2025TAMP: Token-Adaptive Layerwise Pruning in Multimodal Large Language Models14 Apr 2025
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning8 Apr 2024
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metric12 Mar 2024
- 2023Identifying Appropriate Intellectual Property Protection Mechanisms for Machine Learning Models: A Systematization of Watermarking, Fingerprinting, Model Access, and Attackscited by 11
- 2024Edge Unlearning is Not "on Edge"! An Adaptive Exact Unlearning System on Resource-Constrained Devicescited by 8
- 2022Seeds Don't Lie: An Adaptive Watermarking Framework for Computer Vision Modelscited by 0
- 2026T2S: A Rehearsal-Based Approach for Extraction-Resistant Model Watermarkingcited by 0
- 2026T2S: A Rehearsal-Based Approach for Extraction-Resistant Model Watermarking10 Jun 2026
- 2024Edge Unlearning is Not "on Edge"! An Adaptive Exact Unlearning System on Resource-Constrained Devices14 Oct 2024
- 2023Identifying Appropriate Intellectual Property Protection Mechanisms for Machine Learning Models: A Systematization of Watermarking, Fingerprinting, Model Access, and Attacks22 Apr 2023
- 2022Seeds Don't Lie: An Adaptive Watermarking Framework for Computer Vision Models24 Nov 2022
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
- 2023Ego-Exo4D: Understanding Skilled Human Activity from First- and Third-Person Perspectivescited by 477
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 153
12 most cited of 570 All 570 (JSON)
- 2026Universal Cross-Prompt Adversarial Attacks on Promptable Concept Segmentation30 Sep 2026
- 2026Input-Layer Starvation: Why Per-Layer Pruning Breaks IoT Intrusion Detectors25 Sep 2026
- 2026Dense Structural Compression of Transformers via Gauge-Correct Channel Removal7 Sep 2026
- 2026Deep Microcompression: Structured Pruning and Bit-packed Quantization for Microcontrollers4 Sep 2026
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategy4 Sep 2026
- 2026LegoLM: Structured Weight Sharing for Large Language Models9 Aug 2026
- 2026BnBERT-iPET: Sparse Few-Shot Language Modeling for Bengali via Lottery Ticket Pruning5 Aug 2026
- 2026Lottery Tickets Are Not Deployment Tickets29 Jul 2026
- 2026Hybrid Compression: Integrating Pruning and Quantization for Optimized Neural Networks22 Jun 2026
- 2026SCENIC: Semantic-Conditioned Edge-Aware Neural Framework for Structured IoT Command Generation21 Jun 2026
- 2026Squeeze-Release: Iterative Pruning with Exact Structural Minimization12 Jun 2026
- 2026Efficiency-Performance Trade-offs in Neural Speaker Diarization via Structured Pruning and Low-Bit Quantization12 Jun 2026
12 newest of 570 All 570 (JSON)