mlsanityData to 7 Oct 2026

Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Prediction

arXiv 2110.08232 ↗First posted 15 Oct 2021cs.CV cs.LGcited by 24

Not on the map. Why?

Abstract (arXiv)

Dynamic model pruning is a recent direction that allows for the inference of a different sub-network for each input sample during deployment. However, current dynamic methods rely on learning a continuous channel gating through regularization by inducing sparsity loss. This formulation introduces complexity in balancing different losses (e.g task loss, regularization loss). In addition, regularization based methods lack transparent tradeoff hyperparameter selection to realize a computational budget. Our contribution is two-fold: 1) decoupled task and pruning losses. 2) Simple hyperparameter selection that enables FLOPs reduction estimation before training. Inspired by the Hebbian theory in Neuroscience: "neurons that fire together wire together", we propose to predict a mask to process k filters in a layer based on the activation of its previous layer. We pose the problem as a self-supervised binary classification problem. Each mask predictor module is trained to predict if the log-likelihood for each filter in the current layer belongs to the top-k activated filters. The value k is dynamically estimated for each input based on a novel criterion using the mass of heatmaps. We show experiments on several neural architectures, such as VGG, ResNet and MobileNet on CIFAR and ImageNet datasets. On CIFAR, we reach similar accuracy to SOTA methods with 15% and 24% higher FLOPs reduction. Similarly in ImageNet, we achieve lower drop in accuracy with up to 13% improvement in FLOPs reduction.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). Builds on 38 of its 50 references that are in the map. First posted on arXiv 15 Oct 2021.

Builds on

38 of 50 references.

References · 38

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2017Squeeze-and-Excitation Networkscited by 4,763
  5. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  7. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  8. 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
  9. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  10. 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
  11. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
  12. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
26 more
  1. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  2. 2018Rethinking the Value of Network Pruningcited by 595
  3. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  4. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  5. 2019Importance Estimation for Neural Network Pruningcited by 531
  6. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
  7. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  8. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  9. 2018LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networkscited by 272
  10. 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
  11. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  12. 2019Additive Powers-of-Two Quantization: An Efficient Non-uniform Discretization for Neural Networkscited by 143
  13. 2016Designing Energy-Efficient Convolutional Neural Networks using Energy-Aware Pruningcited by 133
  14. 2018Dynamic Channel Pruning: Feature Boosting and Suppressioncited by 129
  15. 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
  16. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
  17. 2018Channel Gating Neural Networkscited by 80
  18. 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
  19. 2018Benchmark Analysis of Representative Deep Neural Network Architecturescited by 77
  20. 2017More is Less: A More Complicated Network with Less Inference Complexitycited by 66
  21. 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
  22. 2017Dynamic Deep Neural Networks: Optimizing Accuracy-Efficiency Trade-offs by Selective Executioncited by 59
  23. 2020To Filter Prune, or to Layer Prune, That Is The Questioncited by 23
  24. 2020Prune Responsiblycited by 20
  25. 2018ECC: Platform-Independent Energy-Constrained Deep Neural Network Compression via a Bilinear Regression Modelcited by 15
  26. 2019Lightweight Monocular Depth Estimation Model by Joint End-to-End Filter pruningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 10; 2024: 4; 2025: 4; 2026: 2.

24 papers.

Sort:

By area:

  1. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  2. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  3. 2023Solving Oscillation Problem in Post-Training Quantization Through a Theoretical Perspectivecited by 17
  4. 2024Not All Prompts Are Made Equal: Prompt-based Pruning of Text-to-Image Diffusion Modelscited by 13
  5. 2023PDP: Parameter-free Differentiable Pruning is All You Needcited by 12
  6. 2024Jointly Training and Pruning CNNs via Learnable Agent Guidance and Alignmentcited by 9
  7. 2022OLLA: Optimizing the Lifetime and Location of Arrays to Reduce the Memory Usage of Neural Networkscited by 6
  8. 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retrainingcited by 4
  9. 2023Data-Free Dynamic Compression of CNNs for Tractable Efficiencycited by 4
  10. 2022Compact Model Training by Low-Rank Projection with Energy Transfercited by 3
  11. 2023LAPP: Layer Adaptive Progressive Pruning for Compressing CNNs from Scratchcited by 2
  12. 2023A Differentiable Framework for End-to-End Learning of Hybrid Structured Compressioncited by 1
12 more
  1. 2023Dynamic Shuffle: An Efficient Channel Mixture Methodcited by 1
  2. 2024Stochastic Subnetwork Annealing: A Regularization Technique for Fine Tuning Pruned Subnetworkscited by 1
  3. 2025Enhanced Structured Lasso Pruning with Class-wise Informationcited by 1
  4. 2025PROM: Prioritize Reduction of Multiplications Over Lower Bit-Widths for Efficient CNNscited by 1
  5. 2025Frugal Machine Learning for Energy-efficient, and Resource-aware Artificial Intelligencecited by 1
  6. 2021Self-supervised Feature-Gate Coupling for Dynamic Network Pruningcited by 0
  7. 2022CWP: Instance complexity weighted channel-wise soft masks for network pruningcited by 0
  8. 2023Rewarded meta-pruning: Meta Learning with Rewards for Channel Pruningcited by 0
  9. 2024Reduced storage direct tensor ring decomposition for convolutional neural networks compressioncited by 0
  10. 2025Exchangeability in Neural Network and its Application to Dynamic Pruningcited by 0
  11. 2026Spectral Complex Autoencoder Pruning: A Fidelity-Guided Criterion for Extreme Structured Channel Compressioncited by 0
  12. 2026HASTE: A Framework for Training-Free, Dynamic, and Steerable Compression of Pre-Trained Convolutional Neural Networkscited by 0