AdaPruner: Adaptive Channel Pruning and Effective Weights Inheritance
Not on the map. Why?
Abstract (arXiv)
Channel pruning is one of the major compression approaches for deep neural networks. While previous pruning methods have mostly focused on identifying unimportant channels, channel pruning is considered as a special case of neural architecture search in recent years. However, existing methods are either complicated or prone to sub-optimal pruning. In this paper, we propose a pruning framework that adaptively determines the number of each layer's channels as well as the wights inheritance criteria for sub-network. Firstly, evaluate the importance of each block in the network based on the mean of the scaling parameters of the BN layers. Secondly, use the bisection method to quickly find the compact sub-network satisfying the budget. Finally, adaptively and efficiently choose the weight inheritance criterion that fits the current architecture and fine-tune the pruned network to recover performance. AdaPruner allows to obtain pruned network quickly, accurately and efficiently, taking into account both the structure and initialization weights. We prune the currently popular CNN models (VGG, ResNet, MobileNetV2) on different image classification datasets, and the experimental results demonstrate the effectiveness of our proposed method. On ImageNet, we reduce 32.8% FLOPs of MobileNetV2 with only 0.62% decrease for top-1 accuracy, which exceeds all previous state-of-the-art channel pruning methods. The code will be released.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 33 references that are in the map. First posted on arXiv 14 Sep 2021.
Builds on
28 of 33 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2014Going Deeper with Convolutionscited by 4,231
- 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
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
16 more
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2018Rethinking the Value of Network Pruningcited by 595
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 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
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2021Group Fisher Pruning for Practical Network Compressioncited by 130
- 2020Channel Pruning via Automatic Structure Searchcited by 84
- 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
- 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
- 2019Pruning from Scratchcited by 72
- 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
- 2021AACP: Model Compression by Accurate and Automatic Channel Pruningcited by 4
Built on by
Citing papers per year: 2024: 1.
1 paper.