REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints
Not on the map. Why?
Abstract (arXiv)
Deep learning models deployed on edge devices frequently encounter resource variability, which arises from fluctuating energy levels, timing constraints, or prioritization of other critical tasks within the system. State-of-the-art machine learning pipelines generate resource-agnostic models that are not capable to adapt at runtime. In this work, we introduce Resource-Efficient Deep Subnetworks (REDS) to tackle model adaptation to variable resources. In contrast to the state-of-the-art, REDS leverages structured sparsity constructively by exploiting permutation invariance of neurons, which allows for hardware-specific optimizations. Specifically, REDS achieves computational efficiency by (1) skipping sequential computational blocks identified by a novel iterative knapsack optimizer, and (2) taking advantage of data cache by re-arranging the order of operations in REDS computational graph. REDS supports conventional deep networks frequently deployed on the edge and provides computational benefits even for small and simple networks. We evaluate REDS on eight benchmark architectures trained on the Visual Wake Words, Google Speech Commands, Fashion-MNIST, CIFAR-10 and ImageNet-1K datasets, and test on four off-the-shelf mobile and embedded hardware platforms. We provide a theoretical result and empirical evidence demonstrating REDS' outstanding performance in terms of submodels' test set accuracy, and demonstrate an adaptation time in response to dynamic resource constraints of under 40μs, utilizing a fully-connected network on Arduino Nano 33 BLE.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 49 of its 98 references that are in the map. First posted on arXiv 22 Nov 2023.
Builds on
49 of 98 references.
References · 49
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2016Layer Normalizationcited by 5,669
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 943
37 more
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 752
- 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 673
- 2017In-Datacenter Performance Analysis of a Tensor Processing Unitcited by 618
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2021Dynamic Neural Networks: A Surveycited by 408
- 2018Slimmable Neural Networkscited by 305
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
- 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 215
- 2020TensorFlow Lite Micro: Embedded Machine Learning on TinyML Systemscited by 165
- 2018CMSIS-NN: Efficient Neural Network Kernels for Arm Cortex-M CPUscited by 121
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 120
- 2017Hello Edge: Keyword Spotting on Microcontrollerscited by 110
- 2020Why should we add early exits to neural networks?cited by 70
- 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
- 2020μNAS: Constrained Neural Architecture Search for Microcontrollerscited by 55
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 41
- 2019FastGRNN: A Fast, Accurate, Stable and Tiny Kilobyte Sized Gated Recurrent Neural Networkcited by 38
- 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 36
- 2020Are wider nets better given the same number of parameters?cited by 27
- 2022Edge Impulse: An MLOps Platform for Tiny Machine Learningcited by 24
- 2023The Role of Pre-training Data in Transfer Learningcited by 17
- 2018On Optimizing Operator Fusion Plans for Large-Scale Machine Learning in SystemMLcited by 13
- 2022Understanding the effect of sparsity on neural networks robustnesscited by 8
- 2019Class-dependent Compression of Deep Neural Networkscited by 7
- 2022Studying the impact of magnitude pruning on contrastive learning methodscited by 7
- 2018Larger Norm More Transferable: An Adaptive Feature Norm Approach for Unsupervised Domain Adaptationcited by 6
- 2020Approximation Algorithms for The Generalized Incremental Knapsack Problemcited by 1
- 2021The Case for Approximate Intermittent Computingcited by 1
- 2022DRESS: Dynamic REal-time Sparse Subnetscited by 1
Built on by
Citing papers per year: 2025: 2.
2 papers.