mlsanityData to 7 Oct 2026

Manipulating Identical Filter Redundancy for Efficient Pruning on Deep and Complicated CNN

arXiv 2107.14444 ↗First posted 30 Jul 2021cs.CV cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

The existence of redundancy in Convolutional Neural Networks (CNNs) enables us to remove some filters/channels with acceptable performance drops. However, the training objective of CNNs usually tends to minimize an accuracy-related loss function without any attention paid to the redundancy, making the redundancy distribute randomly on all the filters, such that removing any of them may trigger information loss and accuracy drop, necessitating a following finetuning step for recovery. In this paper, we propose to manipulate the redundancy during training to facilitate network pruning. To this end, we propose a novel Centripetal SGD (C-SGD) to make some filters identical, resulting in ideal redundancy patterns, as such filters become purely redundant due to their duplicates; hence removing them does not harm the network. As shown on CIFAR and ImageNet, C-SGD delivers better performance because the redundancy is better organized, compared to the existing methods. The efficiency also characterizes C-SGD because it is as fast as regular SGD, requires no finetuning, and can be conducted simultaneously on all the layers even in very deep CNNs. Besides, C-SGD can improve the accuracy of CNNs by first training a model with the same architecture but wider layers then squeezing it into the original width.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 61 of its 105 references that are in the map. First posted on arXiv 30 Jul 2021.

Builds on

61 of 105 references.

References · 61

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  5. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  6. 2016Densely Connected Convolutional Networkscited by 6,691
  7. 2016Feature Pyramid Networks for Object Detectioncited by 5,021
  8. 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
  9. 2016Pyramid Scene Parsing Networkcited by 2,472
  10. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  11. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  12. 2014FitNets: Hints for Thin Deep Netscited by 1,619
38 more
  1. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  2. 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
  3. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  4. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  5. 2018Rethinking the Value of Network Pruningcited by 595
  6. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  7. 2013Do Deep Nets Really Need to be Deep?cited by 466
  8. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
  9. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
  10. 2015Deep Learning with Limited Numerical Precisioncited by 368
  11. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  12. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  13. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  14. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  15. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  16. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  17. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  18. 2013Predicting Parameters in Deep Learningcited by 223
  19. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
  20. 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 212
  21. 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 161
  22. 2015Structured Pruning of Deep Convolutional Neural Networkscited by 148
  23. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
  24. 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 118
  25. 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
  26. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  27. 2013Fast Training of Convolutional Networks through FFTscited by 89
  28. 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
  29. 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
  30. 2016Learning the Number of Neurons in Deep Networkscited by 69
  31. 2020Methods for Pruning Deep Neural Networkscited by 49
  32. 2017Compression-aware Training of Deep Networkscited by 46
  33. 2015Structured Transforms for Small-Footprint Deep Learningcited by 41
  34. 2019Approximated Oracle Filter Pruning for Destructive CNN Width Optimizationcited by 35
  35. 2014Fast Convolutional Nets With fbfft: A GPU Performance Evaluationcited by 27
  36. 2018Learning to Prune Filters in Convolutional Neural Networkscited by 25
  37. 2018Leveraging Filter Correlations for Deep Model Compressioncited by 23
  38. 2020Filter Sketch for Network Pruningcited by 20

50 most cited of 61 All 61 (JSON)

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 3; 2025: 2.

9 papers.