Depth Pruning with Auxiliary Networks for TinyML
Not on the map. Why?
Abstract (arXiv)
Pruning is a neural network optimization technique that sacrifices accuracy in exchange for lower computational requirements. Pruning has been useful when working with extremely constrained environments in tinyML. Unfortunately, special hardware requirements and limited study on its effectiveness on already compact models prevent its wider adoption. Depth pruning is a form of pruning that requires no specialized hardware but suffers from a large accuracy falloff. To improve this, we propose a modification that utilizes a highly efficient auxiliary network as an effective interpreter of intermediate feature maps. Our results show a parameter reduction of 93% on the MLPerfTiny Visual Wakewords (VWW) task and 28% on the Keyword Spotting (KWS) task with accuracy cost of 0.65% and 1.06% respectively. When evaluated on a Cortex-M0 microcontroller, our proposed method reduces the VWW model size by 4.7x and latency by 1.6x while counter intuitively gaining 1% accuracy. KWS model size on Cortex-M0 was also reduced by 1.2x and latency by 1.2x at the cost of 2.21% accuracy.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 15 of its 21 references that are in the map. First posted on arXiv 22 Apr 2022.
Builds on
15 of 21 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2016Understanding intermediate layers using linear classifier probescited by 1,279
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 741
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2020What is the State of Neural Network Pruning?cited by 578
- 2021MLPerf Tiny Benchmarkcited by 118
- 2017Hello Edge: Keyword Spotting on Microcontrollerscited by 108
- 2020Benchmarking TinyML Systems: Challenges and Directioncited by 89
3 more
- 2019SpArSe: Sparse Architecture Search for CNNs on Resource-Constrained Microcontrollerscited by 52
- 2019Visual Wake Words Datasetcited by 46
- 2021A Generalized Lottery Ticket Hypothesiscited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2.
4 papers.
- 2023A Machine Learning-oriented Survey on Tiny Machine Learningcited by 26
- 2024RedTest: Towards Measuring Redundancy in Deep Neural Networks Effectivelycited by 4
- 2025Designing Object Detection Models for TinyML: Foundations, Comparative Analysis, Challenges, and Emerging Solutionscited by 1
- 2025End-to-end fully-binarized network design: from Generic Learned Thermometer to Block Pruningcited by 0
- 2025Designing Object Detection Models for TinyML: Foundations, Comparative Analysis, Challenges, and Emerging Solutions11 Aug 2025
- 2025End-to-end fully-binarized network design: from Generic Learned Thermometer to Block Pruning5 May 2025
- 2024RedTest: Towards Measuring Redundancy in Deep Neural Networks Effectively15 Nov 2024
- 2023A Machine Learning-oriented Survey on Tiny Machine Learning21 Sep 2023