Shapley Pruning for Neural Network Compression
Not on the map. Why?
Abstract (arXiv)
Neural network pruning is a rich field with a variety of approaches. In this work, we propose to connect the existing pruning concepts such as leave-one-out pruning and oracle pruning and develop them into a more general Shapley value-based framework that targets the compression of convolutional neural networks. To allow for practical applications in utilizing the Shapley value, this work presents the Shapley value approximations, and performs the comparative analysis in terms of cost-benefit utility for the neural network compression. The proposed ranks are evaluated against a new benchmark, Oracle rank, constructed based on oracle sets. The broad experiments show that the proposed normative ranking and its approximations show practical results, obtaining state-of-the-art network compression.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 44 of its 58 references that are in the map. First posted on arXiv 19 Jul 2024.
Builds on
44 of 58 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2014Going Deeper with Convolutionscited by 4,231
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2016Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoisingcited by 1,352
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
32 more
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 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
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
- 2015Structured Pruning of Deep Convolutional Neural Networkscited by 148
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2017Bayesian Compression for Deep Learningcited by 116
- 2015Data-free parameter pruning for Deep Neural Networkscited by 112
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2020Neuron Shapley: Discovering the Responsible Neuronscited by 98
- 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
- 2020ResRep: Lossless CNN Pruning via Decoupling Remembering and Forgettingcited by 85
- 2015Fast ConvNets Using Group-wise Brain Damagecited by 81
- 2018AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inferencecited by 77
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2020DHP: Differentiable Meta Pruning via HyperNetworkscited by 57
- 2020Discrimination-aware Network Pruning for Deep Model Compressioncited by 50
- 2022Revisiting Random Channel Pruning for Neural Network Compressioncited by 50
- 2016Pruning Convolutional Neural Networks for Resource Efficient Inferencecited by 47
- 2018Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compressioncited by 40
- 2017Structured Bayesian Pruning via Log-Normal Multiplicative Noisecited by 39
- 2014Efficient Computation of the Shapley Value for Game-Theoretic Network Centralitycited by 14
- 2020Shapley Value as Principled Metric for Structured Network Pruningcited by 8
- 2018FLOPs as a Direct Optimization Objective for Learning Sparse Neural Networkscited by 7
- 2019Analysing Neural Network Topologies: a Game Theoretic Approachcited by 6
- 2019Radial and Directional Posteriors for Bayesian Neural Networkscited by 5
- 2020Dirichlet Pruning for Neural Network Compressioncited by 3
- 2023Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completioncited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.