mlsanityData to 7 Oct 2026

AP: Selective Activation for De-sparsifying Pruned Neural Networks

arXiv 2212.06145 ↗First posted 9 Dec 2022cs.LG cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

The rectified linear unit (ReLU) is a highly successful activation function in neural networks as it allows networks to easily obtain sparse representations, which reduces overfitting in overparameterized networks. However, in network pruning, we find that the sparsity introduced by ReLU, which we quantify by a term called dynamic dead neuron rate (DNR), is not beneficial for the pruned network. Interestingly, the more the network is pruned, the smaller the dynamic DNR becomes during optimization. This motivates us to propose a method to explicitly reduce the dynamic DNR for the pruned network, i.e., de-sparsify the network. We refer to our method as Activating-while-Pruning (AP). We note that AP does not function as a stand-alone method, as it does not evaluate the importance of weights. Instead, it works in tandem with existing pruning methods and aims to improve their performance by selective activation of nodes to reduce the dynamic DNR. We conduct extensive experiments using popular networks (e.g., ResNet, VGG) via two classical and three state-of-the-art pruning methods. The experimental results on public datasets (e.g., CIFAR-10/100) suggest that AP works well with existing pruning methods and improves the performance by 3% - 4%. For larger scale datasets (e.g., ImageNet) and state-of-the-art networks (e.g., vision transformer), we observe an improvement of 2% - 3% with AP as opposed to without. Lastly, we conduct an ablation study to examine the effectiveness of the components comprising AP.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 37 of its 59 references that are in the map. First posted on arXiv 9 Dec 2022.

Builds on

37 of 59 references.

References · 37

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  5. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  6. 2016Densely Connected Convolutional Networkscited by 6,691
  7. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  10. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  11. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  12. 2016An overview of gradient descent optimization algorithmscited by 1,021
25 more
  1. 2021CrossViT: Cross-Attention Multi-Scale Vision Transformer for Image Classificationcited by 806
  2. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  3. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  4. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  5. 2018Rethinking the Value of Network Pruningcited by 595
  6. 2020What is the State of Neural Network Pruning?cited by 578
  7. 2021Towards Open World Object Detectioncited by 297
  8. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  9. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  10. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
  11. 2021Dynamic Head: Unifying Object Detection Heads with Attentionscited by 185
  12. 2021VOLO: Vision Outlooker for Visual Recognitioncited by 164
  13. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  14. 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
  15. 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
  16. 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
  17. 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
  18. 2019Pruning from Scratchcited by 72
  19. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
  20. 2020Lookahead: A Far-Sighted Alternative of Magnitude-based Pruningcited by 61
  21. 2019Neural Network Pruning with Residual-Connections and Limited-Datacited by 52
  22. 2019Sparse Transfer Learning via Winning Lottery Ticketscited by 27
  23. 2020The effect of Target Normalization and Momentum on Dying ReLUcited by 5
  24. 2016Sparsity Measure of a Network Graph: Gini Indexcited by 4
  25. 2021S-Cyc: A Learning Rate Schedule for Iterative Pruning of ReLU-based Networkscited by 2

Built on by

Not cited yet.