An Effective Information Theoretic Framework for Channel Pruning
Yihao Chen, Zefang Wang

TL;DR
This paper introduces an information-theoretic framework for channel pruning in neural networks, using entropy and rank to determine layer importance, and employs Shapley values for channel importance, leading to improved model compression with minimal accuracy loss.
Contribution
The paper proposes a novel channel pruning method based on information entropy, matrix rank, and Shapley values, providing a more interpretable and effective pruning criterion.
Findings
Improves accuracy by 0.21% with 45.5% FLOPs reduction on ResNet-56/CIFAR-10.
Achieves 0.43% Top-1 accuracy loss with 41.6% FLOPs reduction on ResNet-50/ImageNet.
Demonstrates the effectiveness of the information concentration metric for layer-wise pruning.
Abstract
Channel pruning is a promising method for accelerating and compressing convolutional neural networks. However, current pruning algorithms still remain unsolved problems that how to assign layer-wise pruning ratios properly and discard the least important channels with a convincing criterion. In this paper, we present a novel channel pruning approach via information theory and interpretability of neural networks. Specifically, we regard information entropy as the expected amount of information for convolutional layers. In addition, if we suppose a matrix as a system of linear equations, a higher-rank matrix represents there exist more solutions to it, which indicates more uncertainty. From the point of view of information theory, the rank can also describe the amount of information. In a neural network, considering the rank and entropy as two information indicators of convolutional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsPruning
