paper-with-me

홈 › Papers

DNNShifter: An Efficient DNN Pruning System for Edge Computing

2023-09-13 · Bailey J. Eccles, Philip Rodgers, Peter Kilpatrick, Ivor Spence, Blesson Varghese

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.

📄 PDF Abstract BibTeX arXiv:2309.06973

Code (1)

blessonvar/dnnshifter 공식 구현 pytorch

Tasks

Edge-computing

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Rapid Deployment of DNNs for Edge Computing via Structured Pruning at Initialization

2024-04-22 · Bailey J. Eccles, Leon Wong, Blesson Varghese

Edge machine learning (ML) enables localized processing of data on devices and is underpinned by deep neural networks (DNNs). However, DNNs cannot be easily run on devices due to their substantial computing, memory and e…

Edge-computingModel CompressionNeural Architecture Search

Learning to Optimize Resource Assignment for Task Offloading in Mobile Edge Computing

2022-03-15 · Yurong Qian, Jindan Xu, Shuhan Zhu, Wei Xu 외

In this paper, we consider a multiuser mobile edge computing (MEC) system, where a mixed-integer offloading strategy is used to assist the resource assignment for task offloading. Although the conventional branch and bou…

Edge-computing

Block Pruning for Enhanced Efficiency in Convolutional Neural Networks

2023-12-28 · Cheng-En Wu, Azadeh Davoodi, Yu Hen Hu

This paper presents a novel approach to network pruning, targeting block pruning in deep neural networks for edge computing environments. Our method diverges from traditional techniques that utilize proxy metrics, instea…

Edge-computingNetwork Pruning

Keyword Spotting System and Evaluation of Pruning and Quantization Methods on Low-power Edge Microcontrollers

2022-08-04 · Jingyi Wang, Shengchen Li

Keyword spotting (KWS) is beneficial for voice-based user interactions with low-power devices at the edge. The edge devices are usually always-on, so edge computing brings bandwidth savings and privacy protection. The de…

Edge-computingKeyword SpottingQuantization

BLK-REW: A Unified Block-based DNN Pruning Framework using Reweighted Regularization Method

2020-01-23 · Xiaolong Ma, Zhengang Li, Yifan Gong, Tianyun Zhang 외

Accelerating DNN execution on various resource-limited computing platforms has been a long-standing problem. Prior works utilize l1-based group lasso or dynamic regularization such as ADMM to perform structured pruning o…