Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2311.13349 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911078692159488 |
|---|---|
| author | Corti, Francesco Maag, Balz Schauer, Joachim Pferschy, Ulrich Saukh, Olga |
| author_facet | Corti, Francesco Maag, Balz Schauer, Joachim Pferschy, Ulrich Saukh, Olga |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_13349 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints Corti, Francesco Maag, Balz Schauer, Joachim Pferschy, Ulrich Saukh, Olga Machine Learning 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. |
| title | REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2311.13349 |