Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importance
Not on the map. Why?
Abstract (arXiv)
Recent advancements have scaled neural networks to unprecedented sizes, achieving remarkable performance across a wide range of tasks. However, deploying these large-scale models on resource-constrained devices poses significant challenges due to substantial storage and computational requirements. Neural network pruning has emerged as an effective technique to mitigate these limitations by reducing model size and complexity. In this paper, we introduce an intuitive and interpretable pruning method based on activation statistics, rooted in information theory and statistical analysis. Our approach leverages the statistical properties of neuron activations to identify and remove weights with minimal contributions to neuron outputs. Specifically, we build a distribution of weight contributions across the dataset and utilize its parameters to guide the pruning process. Furthermore, we propose a Pruning-aware Training strategy that incorporates an additional regularization term to enhance the effectiveness of our pruning method. Extensive experiments on multiple datasets and network architectures demonstrate that our method consistently outperforms several baseline and state-of-the-art pruning techniques.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 31 references that are in the map. First posted on arXiv 21 Oct 2024.
Builds on
25 of 31 references.
References · 25
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2023DepGraph: Towards Any Structural Pruningcited by 202
13 more
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2018Mean Field Analysis of Neural Networks: A Central Limit Theoremcited by 107
- 2019Pruning from Scratchcited by 72
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2023Beyond Normal: On the Evaluation of Mutual Information Estimatorscited by 37
- 2022Dual Lottery Ticket Hypothesiscited by 27
- 2024Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratchcited by 20
- 2024Masks, Signs, And Learning Rate Rewindingcited by 15
- 2024What Do You See? Enhancing Zero-Shot Image Classification with Multimodal Large Language Modelscited by 10
- 2024Jointly Training and Pruning CNNs via Learnable Agent Guidance and Alignmentcited by 9
- 2024Towards Meta-Pruning via Optimal Transportcited by 8
- 2023Sparse Weight Averaging with Multiple Particles for Iterative Magnitude Pruningcited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.