Filter Pruning For CNN With Enhanced Linear Representation Redundancy
Not on the map. Why?
Abstract (arXiv)
Structured network pruning excels non-structured methods because they can take advantage of the thriving developed parallel computing techniques. In this paper, we propose a new structured pruning method. Firstly, to create more structured redundancy, we present a data-driven loss function term calculated from the correlation coefficient matrix of different feature maps in the same layer, named CCM-loss. This loss term can encourage the neural network to learn stronger linear representation relations between feature maps during the training from the scratch so that more homogenous parts can be removed later in pruning. CCM-loss provides us with another universal transcendental mathematical tool besides L*-norm regularization, which concentrates on generating zeros, to generate more redundancy but for the different genres. Furthermore, we design a matching channel selection strategy based on principal components analysis to exploit the maximum potential ability of CCM-loss. In our new strategy, we mainly focus on the consistency and integrality of the information flow in the network. Instead of empirically hard-code the retain ratio for each layer, our channel selection strategy can dynamically adjust each layer's retain ratio according to the specific circumstance of a per-trained model to push the prune ratio to the limit. Notably, on the Cifar-10 dataset, our method brings 93.64% accuracy for pruned VGG-16 with only 1.40M parameters and 49.60M FLOPs, the pruned ratios for parameters and FLOPs are 90.6% and 84.2%, respectively. For ResNet-50 trained on the ImageNet dataset, our approach achieves 42.8% and 47.3% storage and computation reductions, respectively, with an accuracy of 76.23%. Our code is available at https://github.com/Bojue-Wang/CCM-LRR.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 30 references that are in the map. First posted on arXiv 10 Oct 2023.
Builds on
24 of 30 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 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
12 more
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
- 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
- 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2018Accelerate CNN via Recursive Bayesian Pruningcited by 27
- 2022Teacher-Student Architecture for Knowledge Learning: A Surveycited by 23
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.