Structured Network Pruning by Measuring Filter-wise Interactions
Not on the map. Why?
Abstract (arXiv)
Structured network pruning is a practical approach to reduce computation cost directly while retaining the CNNs' generalization performance in real applications. However, identifying redundant filters is a core problem in structured network pruning, and current redundancy criteria only focus on individual filters' attributes. When pruning sparsity increases, these redundancy criteria are not effective or efficient enough. Since the filter-wise interaction also contributes to the CNN's prediction accuracy, we integrate the filter-wise interaction into the redundancy criterion. In our criterion, we introduce the filter importance and filter utilization strength to reflect the decision ability of individual and multiple filters. Utilizing this new redundancy criterion, we propose a structured network pruning approach SNPFI (Structured Network Pruning by measuring Filter-wise Interaction). During the pruning, the SNPFI can automatically assign the proper sparsity based on the filter utilization strength and eliminate the useless filters by filter importance. After the pruning, the SNPFI can recover pruned model's performance effectively without iterative training by minimizing the interaction difference. We empirically demonstrate the effectiveness of the SNPFI with several commonly used CNN models, including AlexNet, MobileNetv1, and ResNet-50, on various image classification datasets, including MNIST, CIFAR-10, and ImageNet. For all experimental CNN models, nearly 60% of computation is reduced in a network compression while the classification accuracy remains.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 36 of its 53 references that are in the map. First posted on arXiv 3 Jul 2023.
Builds on
36 of 53 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018Image Super-Resolution Using Very Deep Residual Channel Attention Networkscited by 1,256
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
24 more
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2021LLVIP: A Visible-infrared Paired Dataset for Low-light Visioncited by 229
- 2018RUDDER: Return Decomposition for Delayed Rewardscited by 162
- 2015Structured Pruning of Deep Convolutional Neural Networkscited by 148
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
- 2020Explaining Explanations: Axiomatic Feature Interactions for Deep Networkscited by 103
- 2020Neural Pruning via Growing Regularizationcited by 97
- 2022The Shapley Value in Machine Learningcited by 97
- 2020Channel Pruning via Automatic Structure Searchcited by 84
- 2017Detecting Statistical Interactions from Neural Network Weightscited by 80
- 2019Network Pruning via Transformable Architecture Searchcited by 80
- 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
- 2018Hierarchical interpretations for neural network predictionscited by 66
- 2018Automated Machine Learning: From Principles to Practicescited by 62
- 2019Ensemble Knowledge Distillation for Learning Improved and Efficient Networkscited by 46
- 2021Discovering and Explaining the Representation Bottleneck of DNNscited by 42
- 2021Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learningcited by 30
- 2019Neural Network Distiller: A Python Package For DNN Compression Researchcited by 12
- 2020Quantisation and Pruning for Neural Network Compression and Regularisationcited by 9
- 2020Shapley Value as Principled Metric for Structured Network Pruningcited by 8
- 2021Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)cited by 3
Built on by
Not cited yet.