Receding Neuron Importances for Structured Pruning
Not on the map. Why?
Abstract (arXiv)
Structured pruning efficiently compresses networks by identifying and removing unimportant neurons. While this can be elegantly achieved by applying sparsity-inducing regularisation on BatchNorm parameters, an L1 penalty would shrink all scaling factors rather than just those of superfluous neurons. To tackle this issue, we introduce a simple BatchNorm variation with bounded scaling parameters, based on which we design a novel regularisation term that suppresses only neurons with low importance. Under our method, the weights of unnecessary neurons effectively recede, producing a polarised bimodal distribution of importances. We show that neural networks trained this way can be pruned to a larger extent and with less deterioration. We one-shot prune VGG and ResNet architectures at different ratios on CIFAR and ImagenNet datasets. In the case of VGG-style networks, our method significantly outperforms existing approaches particularly under a severe pruning regime.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 27 of its 30 references that are in the map. First posted on arXiv 13 Apr 2022.
Builds on
27 of 30 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2016Layer Normalizationcited by 5,579
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018Group Normalizationcited by 1,514
- 2016Instance Normalization: The Missing Ingredient for Fast Stylizationcited by 1,187
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
15 more
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2018Rethinking the Value of Network Pruningcited by 595
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 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
- 2018How Does Batch Normalization Help Optimization?cited by 355
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
- 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
- 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
- 2018Filter Distillation for Network Compressioncited by 17
- 2018Exploring Linear Relationship in Feature Map Subspace for ConvNets Compressioncited by 11
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.