Enhancing Split Computing and Early Exit Applications through Predefined Sparsity

1 Department of Engineering for Innovation Medicine, University of Verona, Italy 2 Department of Computer Science, The University of North Carolina at Chapel Hill, USA 3 Department of Computer Science, University of Verona, Italy
🎉 Accepted @ FDL 2024 🎉
Teaser
Starting from a DNN ${\mathcal{M}(\cdot{})}$, we first apply the predefined sparsity, and then we train the network. After the training stage, we split the network following the SC and EE paradigm. As a result, the final architecture is not so computationally intensive, doesn't require huge storage spaces, and has less energy consumption, all without compromising the overall performance.

Abstract

In the past decade, Deep Neural Networks (DNNs) achieved state-of-the-art performance in a broad range of problems, spanning from object classification and action recognition to smart building and healthcare. The flexibility that makes DNNs such a pervasive technology comes at a price: the computational requirements preclude their deployment on most of the resource-constrained edge devices available today to solve real-time and real-world tasks. This paper introduces a novel approach to address this challenge by combining the concept of predefined sparsity with Split Computing (SC) and Early Exit (EE). In particular, SC aims at splitting a DNN with a part of it deployed on an edge device and the rest on a remote server. Instead, EE allows the system to stop using the remote server and rely solely on the edge device's computation if the answer is already good enough. Specifically, how to apply such a predefined sparsity to a SC and EE paradigm has never been studied. This paper studies this problem and shows how predefined sparsity significantly reduces the computational, storage, and energy burdens during the training and inference phases, regardless of the hardware platform. This makes it a valuable approach for enhancing the performance of SC and EE applications. Experimental results showcase reductions exceeding $4\times{}$ in storage and computational complexity without compromising performance.

BibTeX

@inproceedings{capogrosso2024enhancing,
    title={Enhancing Split Computing and Early Exit Applications through Predefined Sparsity},
    author={Capogrosso, Luigi and Fraccaroli, Enrico and Petrozziello, Giulio and Setti, Francesco and Chakraborty, Samarjit and Fummi, Franco and Cristani, Marco},
    booktitle={2024 Forum on Specification \& Design Languages (FDL)},
    pages={1--8},
    year={2024},
    organization={IEEE}
}