Neural Networks Reduction via Lumping
Not on the map. Why?
Abstract (arXiv)
The increasing size of recently proposed Neural Networks makes it hard to implement them on embedded devices, where memory, battery and computational power are a non-trivial bottleneck. For this reason during the last years network compression literature has been thriving and a large number of solutions has been been published to reduce both the number of operations and the parameters involved with the models. Unfortunately, most of these reducing techniques are actually heuristic methods and usually require at least one re-training step to recover the accuracy. The need of procedures for model reduction is well-known also in the fields of Verification and Performances Evaluation, where large efforts have been devoted to the definition of quotients that preserve the observable underlying behaviour. In this paper we try to bridge the gap between the most popular and very effective network reduction strategies and formal notions, such as lumpability, introduced for verification and evaluation of Markov Chains. Elaborating on lumpability we propose a pruning approach that reduces the number of neurons in a network without using any data or fine-tuning, while completely preserving the exact behaviour. Relaxing the constraints on the exact definition of the quotienting method we can give a formal explanation of some of the most common reduction techniques.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 57 references that are in the map. First posted on arXiv 15 Sep 2022.
Builds on
35 of 57 references.
References · 35
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2014Going Deeper with Convolutionscited by 4,231
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Searching for MobileNetV3cited by 1,984
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2022CoCa: Contrastive Captioners are Image-Text Foundation Modelscited by 1,265
- 2017ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devicescited by 1,194
23 more
- 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,127
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
- 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
- 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2013Network In Networkcited by 600
- 2020What is the State of Neural Network Pruning?cited by 578
- 2021CoAtNet: Marrying Convolution and Attention for All Data Sizescited by 566
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2016Designing Neural Network Architectures using Reinforcement Learningcited by 277
- 2020A Comprehensive Survey of Neural Architecture Search: Challenges and Solutionscited by 253
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2020A Survey on Evolutionary Neural Architecture Searchcited by 142
- 2022DropNet: Reducing Neural Network Complexity via Iterative Pruningcited by 29
- 2021Bisimulations for Neural Network Reductioncited by 6
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2025Assessing Code Understanding in LLMscited by 2
- 2026Neural Network Compression by Approximate Differential Equivalencecited by 0
- 2026Neural Network Compression by Approximate Differential Equivalence31 May 2026
- 2025Assessing Code Understanding in LLMs31 Mar 2025