HRel: Filter Pruning based on High Relevance between Activation Maps and Class Labels
Not on the map. Why?
Abstract (arXiv)
This paper proposes an Information Bottleneck theory based filter pruning method that uses a statistical measure called Mutual Information (MI). The MI between filters and class labels, also called textitRelevance, is computed using the filter's activation maps and the annotations. The filters having High Relevance (HRel) are considered to be more important. Consequently, the least important filters, which have lower Mutual Information with the class labels, are pruned. Unlike the existing MI based pruning methods, the proposed method determines the significance of the filters purely based on their corresponding activation map's relationship with the class labels. Architectures such as LeNet-5, VGG-16, ResNet-56textcolormyblue, ResNet-110 and ResNet-50 are utilized to demonstrate the efficacy of the proposed pruning method over MNIST, CIFAR-10 and ImageNet datasets. The proposed method shows the state-of-the-art pruning results for LeNet-5, VGG-16, ResNet-56, ResNet-110 and ResNet-50 architectures. In the experiments, we prune 97.98 %, 84.85 %, 76.89%, 76.95%, and 63.99% of Floating Point Operation (FLOP)s from LeNet-5, VGG-16, ResNet-56, ResNet-110, and ResNet-50 respectively. The proposed HRel pruning method outperforms recent state-of-the-art filter pruning methods. Even after pruning the filters from convolutional layers of LeNet-5 drastically (i.e. from 20, 50 to 2, 3, respectively), only a small accuracy drop of 0.52% is observed. Notably, for VGG-16, 94.98% parameters are reduced, only with a drop of 0.36% in top-1 accuracy. textcolormyblueResNet-50 has shown a 1.17% drop in the top-5 accuracy after pruning 66.42% of the FLOPs. In addition to pruning, the Information Plane dynamics of Information Bottleneck theory is analyzed for various Convolutional Neural Network architectures with the effect of pruning.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 47 of its 77 references that are in the map. First posted on arXiv 22 Feb 2022.
Builds on
47 of 77 references.
References · 47
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2014FitNets: Hints for Thin Deep Netscited by 1,653
- 2016YOLO9000: Better, Faster, Strongercited by 1,431
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2018MINE: Mutual Information Neural Estimationcited by 683
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 592
35 more
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2015Deep Speech 2: End-to-End Speech Recognition in English and Mandarincited by 451
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
- 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 215
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 146
- 2020Channel Pruning via Automatic Structure Searchcited by 85
- 2019Network Pruning via Transformable Architecture Searchcited by 80
- 2016Deep Colorizationcited by 70
- 2020DMCP: Differentiable Markov Channel Pruning for Neural Networkscited by 69
- 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
- 2017Estimating Mixture Entropy with Pairwise Distancescited by 36
- 2017Fruit recognition from images using deep learningcited by 35
- 2018Understanding Convolutional Neural Networks with Information Theory: An Initial Explorationcited by 32
- 2016Accurate De Novo Prediction of Protein Contact Map by Ultra-Deep Learning Modelcited by 31
- 2018Asymptotic Soft Filter Pruning for Deep Convolutional Neural Networkscited by 27
- 2021Locally Free Weight Sharing for Network Width Searchcited by 27
- 2016Nesterov's Accelerated Gradient and Momentum as approximations to Regularised Update Descentcited by 26
- 2018Leveraging Filter Correlations for Deep Model Compressioncited by 23
- 2018Scalable Mutual Information Estimation using Dependence Graphscited by 22
- 20182PFPCE: Two-Phase Filter Pruning Based on Conditional Entropycited by 14
- 2019Adaptive Estimators Show Information Compression in Deep Neural Networkscited by 14
- 2019COP: Customized Deep Model Compression via Regularized Correlation-Based Filter-Level Pruningcited by 14
- 2018Understanding Neural Networks and Individual Neuron Importance via Information-Ordered Cumulative Ablationcited by 13
- 2019Information Plane Analysis of Deep Neural Networks via Matrix-Based Renyi's Entropy and Tensor Kernelscited by 12
- 2020MINT: Deep Network Compression via Mutual Information-based Neuron Trimmingcited by 11
- 2020On the Information Plane of Autoencoderscited by 10
- 2019Structured Pruning of Recurrent Neural Networks through Neuron Selectioncited by 7
- 2021Deep Model Compression based on the Training Historycited by 7
- 2019Geometric Estimation of Multivariate Dependencycited by 3
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 2; 2025: 0; 2026: 1.
7 papers.
- 2022Optimal Randomized Approximations for Matrix based Renyi's Entropycited by 7
- 2023Filter Pruning based on Information Capacity and Independencecited by 2
- 2022Robust and Fast Measure of Information via Low-rank Representationcited by 1
- 2024Large Language Model Pruningcited by 1
- 2026GRAIL: Post-hoc Compensation by Linear Reconstruction for Compressed Networkscited by 1
- 2023Accelerating Convolutional Neural Network Pruning via Spatial Aura Entropycited by 0
- 2024Reduced storage direct tensor ring decomposition for convolutional neural networks compressioncited by 0
- 2026GRAIL: Post-hoc Compensation by Linear Reconstruction for Compressed Networks27 Feb 2026
- 2024Large Language Model Pruning24 May 2024
- 2024Reduced storage direct tensor ring decomposition for convolutional neural networks compression17 May 2024
- 2023Accelerating Convolutional Neural Network Pruning via Spatial Aura Entropy8 Dec 2023
- 2023Filter Pruning based on Information Capacity and Independence7 Mar 2023
- 2022Robust and Fast Measure of Information via Low-rank Representation30 Nov 2022
- 2022Optimal Randomized Approximations for Matrix based Renyi's Entropy16 May 2022