mlsanityData to 7 Oct 2026

Filter Pruning based on Information Capacity and Independence

arXiv 2303.03645 ↗First posted 7 Mar 2023cs.CV cs.CCcited by 2

Not on the map. Why?

Abstract (arXiv)

Filter pruning has gained widespread adoption for the purpose of compressing and speeding up convolutional neural networks (CNNs). However, existing approaches are still far from practical applications due to biased filter selection and heavy computation cost. This paper introduces a new filter pruning method that selects filters in an interpretable, multi-perspective, and lightweight manner. Specifically, we evaluate the contributions of filters from both individual and overall perspectives. For the amount of information contained in each filter, a new metric called information capacity is proposed. Inspired by the information theory, we utilize the interpretable entropy to measure the information capacity, and develop a feature-guided approximation process. For correlations among filters, another metric called information independence is designed. Since the aforementioned metrics are evaluated in a simple but effective way, we can identify and prune the least important filters with less computation cost. We conduct comprehensive experiments on benchmark datasets employing various widely-used CNN architectures to evaluate the performance of our method. For instance, on ILSVRC-2012, our method outperforms state-of-the-art methods by reducing FLOPs by 77.4% and parameters by 69.3% for ResNet-50 with only a minor decrease in accuracy of 2.64%.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 70 of its 102 references that are in the map. First posted on arXiv 7 Mar 2023.

Builds on

70 of 102 references.

References · 70

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  6. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  7. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  8. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  9. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
  10. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  11. 2015SSD: Single Shot MultiBox Detectorcited by 3,125
  12. 2015Fast R-CNNcited by 2,930
38 more
  1. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  2. 2018Spatial Temporal Graph Convolutional Networks for Skeleton-Based Action Recognitioncited by 1,199
  3. 2017ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devicescited by 1,194
  4. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  5. 2019Relational Knowledge Distillationcited by 873
  6. 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
  7. 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
  8. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  9. 2018MINE: Mutual Information Neural Estimationcited by 680
  10. 2019Importance Estimation for Neural Network Pruningcited by 531
  11. 2019Similarity-Preserving Knowledge Distillationcited by 507
  12. 2019YOLACT: Real-time Instance Segmentationcited by 441
  13. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
  14. 2017Learning Spatio-Temporal Representation with Pseudo-3D Residual Networkscited by 386
  15. 2016Convolutional Two-Stream Network Fusion for Video Action Recognitioncited by 384
  16. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  17. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  18. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  19. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  20. 2019Actional-Structural Graph Convolutional Networks for Skeleton-based Action Recognitioncited by 228
  21. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
  22. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
  23. 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
  24. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
  25. 2021All Tokens Matter: Token Labeling for Training Better Vision Transformerscited by 144
  26. 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
  27. 2015Convolutional neural networks with low-rank regularizationcited by 102
  28. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
  29. 2020Channel Pruning via Automatic Structure Searchcited by 84
  30. 2021Semantic Relation Reasoning for Shot-Stable Few-Shot Object Detectioncited by 79
  31. 2020Rotated Binary Neural Networkcited by 77
  32. 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
  33. 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
  34. 2021Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Frameworkcited by 52
  35. 2018Bi-Real Net: Binarizing Deep Network Towards Real-Network Performancecited by 42
  36. 2018Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compressioncited by 40
  37. 2018Understanding Convolutional Neural Networks with Information Theory: An Initial Explorationcited by 31
  38. 2014Efficient and Accurate Approximations of Nonlinear Convolutional Networkscited by 30

50 most cited of 70 All 70 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.