Asymptotic Soft Cluster Pruning for Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Filter pruning method introduces structural sparsity by removing selected filters and is thus particularly effective for reducing complexity. Previous works empirically prune networks from the point of view that filter with smaller norm contributes less to the final results. However, such criteria has been proven sensitive to the distribution of filters, and the accuracy may hard to recover since the capacity gap is fixed once pruned. In this paper, we propose a novel filter pruning method called Asymptotic Soft Cluster Pruning (ASCP), to identify the redundancy of network based on the similarity of filters. Each filter from over-parameterized network is first distinguished by clustering, and then reconstructed to manually introduce redundancy into it. Several guidelines of clustering are proposed to better preserve feature extraction ability. After reconstruction, filters are allowed to be updated to eliminate the effect caused by mistakenly selected. Besides, various decaying strategies of the pruning rate are adopted to stabilize the pruning process and improve the final performance as well. By gradually generating more identical filters within each cluster, ASCP can remove them through channel addition operation with almost no accuracy drop. Extensive experiments on CIFAR-10 and ImageNet datasets show that our method can achieve competitive results compared with many state-of-the-art algorithms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 39 references that are in the map. First posted on arXiv 16 Jun 2022.
Builds on
25 of 39 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 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
- 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
- 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
13 more
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2019GhostNet: More Features from Cheap Operationscited by 410
- 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
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2015Neural Networks with Few Multiplicationscited by 46
- 2018Asymptotic Soft Filter Pruning for Deep Convolutional Neural Networkscited by 27
- 2019Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruningcited by 14
- 2020Softer Pruning, Incremental Regularizationcited by 4
Built on by
Not cited yet.