mlsanityData to 7 Oct 2026

Extracting Effective Subnetworks with Gumbel-Softmax

arXiv 2202.12986 ↗First posted 25 Feb 2022cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Large and performant neural networks are often overparameterized and can be drastically reduced in size and complexity thanks to pruning. Pruning is a group of methods, which seeks to remove redundant or unnecessary weights or groups of weights in a network. These techniques allow the creation of lightweight networks, which are particularly critical in embedded or mobile applications. In this paper, we devise an alternative pruning method that allows extracting effective subnetworks from larger untrained ones. Our method is stochastic and extracts subnetworks by exploring different topologies which are sampled using Gumbel Softmax. The latter is also used to train probability distributions which measure the relevance of weights in the sampled topologies. The resulting subnetworks are further enhanced using a highly efficient rescaling mechanism that reduces training time and improves performance. Extensive experiments conducted on CIFAR show the outperformance of our subnetwork extraction method against the related work.

Key facts. Cited by 2 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 25 Feb 2022.

Builds on

27 of 30 references.

References · 27

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  3. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  4. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  5. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  6. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  7. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  10. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  11. 2014FitNets: Hints for Thin Deep Netscited by 1,619
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,129
15 more
  1. 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
  2. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  3. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  4. 2017Deep Mutual Learningcited by 621
  5. 2018Rethinking the Value of Network Pruningcited by 595
  6. 2019Improved Knowledge Distillation via Teacher Assistantcited by 567
  7. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  8. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  9. 2019Variational Information Distillation for Knowledge Transfercited by 321
  10. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
  11. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  12. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
  13. 2017CondenseNet: An Efficient DenseNet using Learned Group Convolutionscited by 121
  14. 2020Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficientcited by 81
  15. 2020Logarithmic Pruning is All You Needcited by 71

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.