DNNShifter: An Efficient DNN Pruning System for Edge Computing
Not on the map. Why?
Abstract (arXiv)
Deep neural networks (DNNs) underpin many machine learning applications. Production quality DNN models achieve high inference accuracy by training millions of DNN parameters which has a significant resource footprint. This presents a challenge for resources operating at the extreme edge of the network, such as mobile and embedded devices that have limited computational and memory resources. To address this, models are pruned to create lightweight, more suitable variants for these devices. Existing pruning methods are unable to provide similar quality models compared to their unpruned counterparts without significant time costs and overheads or are limited to offline use cases. Our work rapidly derives suitable model variants while maintaining the accuracy of the original model. The model variants can be swapped quickly when system and network conditions change to match workload demand. This paper presents DNNShifter, an end-to-end DNN training, spatial pruning, and model switching system that addresses the challenges mentioned above. At the heart of DNNShifter is a novel methodology that prunes sparse models using structured pruning. The pruned model variants generated by DNNShifter are smaller in size and thus faster than dense and sparse model predecessors, making them suitable for inference at the edge while retaining near similar accuracy as of the original dense model. DNNShifter generates a portfolio of model variants that can be swiftly interchanged depending on operational conditions. DNNShifter produces pruned model variants up to 93x faster than conventional training methods. Compared to sparse models, the pruned model variants are up to 5.14x smaller and have a 1.67x inference latency speedup, with no compromise to sparse model accuracy. In addition, DNNShifter has up to 11.9x lower overhead for switching models and up to 3.8x lower memory utilisation than existing approaches.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 31 of its 50 references that are in the map. First posted on arXiv 13 Sep 2023.
Builds on
31 of 50 references.
References · 31
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2018DARTS: Differentiable Architecture Searchcited by 1,798
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,101
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
19 more
- 2020What is the State of Neural Network Pruning?cited by 583
- 2021RepVGG: Making VGG-style ConvNets Great Againcited by 522
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2021Dynamic Neural Networks: A Surveycited by 408
- 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 332
- 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 295
- 2021Ensemble deep learning: A reviewcited by 284
- 2019Model Pruning Enables Efficient Federated Learning on Edge Devicescited by 222
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
- 2022Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradientscited by 34
- 2019Non-Structured DNN Weight Pruning -- Is It Beneficial in Any Platform?cited by 32
- 2023NTK-SAP: Improving neural network pruning by aligning training dynamicscited by 30
- 2021Dynamic-OFA: Runtime DNN Architecture Switching for Performance Scaling on Heterogeneous Embedded Platformscited by 18
- 2018Compact and Computationally Efficient Representation of Deep Neural Networkscited by 11
- 2023PreNAS: Preferred One-Shot Learning Towards Efficient Neural Architecture Searchcited by 11
- 2018Characterising Across-Stack Optimisations for Deep Convolutional Neural Networkscited by 10
- 2022Structured Pruning is All You Need for Pruning CNNs at Initializationcited by 7
- 2020PruneNet: Channel Pruning via Global Importancecited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 3; 2026: 1.
8 papers.
- 2025Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representationscited by 5
- 2024Learned Best-Effort LLM Servingcited by 2
- 2024Reducing Inference Energy Consumption Using Dual Complementary CNNscited by 2
- 2024NeuroFlux: Memory-Efficient CNN Training Using Adaptive Local Learningcited by 1
- 2024Rapid Deployment of DNNs for Edge Computing via Structured Pruning at Initializationcited by 1
- 2025Mosaic: Composite Projection Pruning for Resource-efficient LLMscited by 1
- 2025Onboard Optimization and Learning: A Surveycited by 1
- 2026Multi-DNN Inference of Sparse Models on Edge SoCscited by 0
- 2026Multi-DNN Inference of Sparse Models on Edge SoCs10 Mar 2026
- 2025Onboard Optimization and Learning: A Survey7 May 2025
- 2025Mosaic: Composite Projection Pruning for Resource-efficient LLMs8 Apr 2025
- 2025Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representations18 Feb 2025
- 2024Reducing Inference Energy Consumption Using Dual Complementary CNNs2 Dec 2024
- 2024Rapid Deployment of DNNs for Edge Computing via Structured Pruning at Initialization22 Apr 2024
- 2024NeuroFlux: Memory-Efficient CNN Training Using Adaptive Local Learning21 Feb 2024
- 2024Learned Best-Effort LLM Serving15 Jan 2024