SeReNe: Sensitivity based Regularization of Neurons for Structured Sparsity in Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep neural networks include millions of learnable parameters, making their deployment over resource-constrained devices problematic. SeReNe (Sensitivity-based Regularization of Neurons) is a method for learning sparse topologies with a structure, exploiting neural sensitivity as a regularizer. We define the sensitivity of a neuron as the variation of the network output with respect to the variation of the activity of the neuron. The lower the sensitivity of a neuron, the less the network output is perturbed if the neuron output changes. By including the neuron sensitivity in the cost function as a regularization term, we areable to prune neurons with low sensitivity. As entire neurons are pruned rather then single parameters, practical network footprint reduction becomes possible. Our experimental results on multiple network architectures and datasets yield competitive compression ratios with respect to state-of-the-art references.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 7 Feb 2021.
Builds on
25 of 37 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2015Distillation as a Defense to Adversarial Perturbations against Deep Neural Networkscited by 675
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2015Variational Dropout and the Local Reparameterization Trickcited by 489
13 more
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 212
- 2017Soft Weight-Sharing for Neural Network Compressioncited by 99
- 2020Channel Pruning via Automatic Structure Searchcited by 84
- 2015Fast ConvNets Using Group-wise Brain Damagecited by 81
- 2019Pruning from Scratchcited by 72
- 2019Learning Sparse Networks Using Targeted Dropoutcited by 40
- 2018Learning Sparse Neural Networks via Sensitivity-Driven Regularizationcited by 26
- 2020Pruning artificial neural networks: a way to find well-generalizing, high-entropy sharp minimacited by 8
- 2019Post-synaptic potential regularization has potentialcited by 1
Built on by
Citing papers per year: 2022: 4; 2023: 2; 2024: 3; 2025: 1; 2026: 2.
12 papers.
- 2022Compressing Explicit Voxel Grid Representations: fast NeRFs become also smallcited by 48
- 2022To update or not to update? Neurons at equilibrium in deep modelscited by 13
- 2022The rise of the lottery heroes: why zero-shot pruning is hardcited by 7
- 2024Layer Collapse Can be Induced by Unstructured Pruningcited by 4
- 2022Towards Efficient Capsule Networkscited by 3
- 2024The Simpler The Better: An Entropy-Based Importance Metric To Reduce Neural Networks' Depthcited by 3
- 2023Inshrinkerator: Compressing Deep Learning Training Checkpoints via Dynamic Quantizationcited by 2
- 2023Find the Lady: Permutation and Re-Synchronization of Deep Neural Networkscited by 1
- 2024LaCoOT: Layer Collapse through Optimal Transportcited by 1
- 2026Routing the Lottery: Adaptive Subnetworks for Heterogeneous Datacited by 1
- 2025Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networkscited by 0
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategycited by 0
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategy4 Sep 2026
- 2026Routing the Lottery: Adaptive Subnetworks for Heterogeneous Data29 Jan 2026
- 2025Playing the Lottery With Concave Regularizers for Sparse Trainable Neural Networks19 Jan 2025
- 2024LaCoOT: Layer Collapse through Optimal Transport13 Jun 2024
- 2024The Simpler The Better: An Entropy-Based Importance Metric To Reduce Neural Networks' Depth27 Apr 2024
- 2024Layer Collapse Can be Induced by Unstructured Pruning24 Apr 2024
- 2023Find the Lady: Permutation and Re-Synchronization of Deep Neural Networks19 Dec 2023
- 2023Inshrinkerator: Compressing Deep Learning Training Checkpoints via Dynamic Quantization20 Jun 2023
- 2022Compressing Explicit Voxel Grid Representations: fast NeRFs become also small23 Oct 2022
- 2022Towards Efficient Capsule Networks19 Aug 2022
- 2022To update or not to update? Neurons at equilibrium in deep models19 Jul 2022
- 2022The rise of the lottery heroes: why zero-shot pruning is hard24 Feb 2022