A Multi-task Supervised Compression Model for Split Computing

Yoshitomo Matsubara, Matteo Mendula, Marco Levorato
1/2/2025
cs.CVcs.LGeess.IV

No official code found. Best implementation: yoshitomo-matsubara/sc2-benchmark (38 stars, MIT, PyTorch, last commit 2026-03-31). 1 more below.

Abstract

Split computing ($\neq$ split learning) is a promising approach to deep learning models for resource-constrained edge computing systems, where weak sensor (mobile) devices are wirelessly connected to stronger edge servers through channels with limited communication capacity. State-of-theart work on split computing presents methods for single tasks such as image classification, object detection, or semantic segmentation. The application of existing methods to multitask problems degrades model accuracy and/or significantly increase runtime latency. In this study, we propose Ladon, the first multi-task-head supervised compression model for multi-task split computing. Experimental results show that the multi-task supervised compression model either outperformed or rivaled strong lightweight baseline models in terms of predictive performance for ILSVRC 2012, COCO 2017, and PASCAL VOC 2012 datasets while learning compressed representations at its early layers. Furthermore, our models reduced end-to-end latency (by up to 95.4%) and energy consumption of mobile devices (by up to 88.2%) in multi-task split computing scenarios.

View on arXivView PDF

Code Implementations(2)

PyTorchMIT

[WACV 2025] "A Multi-task Supervised Compression Model for Split Computing"

40PythonDec 1, 20241 years agoMIT
cocoimage-classificationimagenetknowledge-distillationmulti-task+7 more
PyTorchMIT

[TMLR] "SC2 Benchmark: Supervised Compression for Split Computing"

3811Shell, PythonOct 24, 20216 months agoMIT
cocoimage-classificationimagenetknowledge-distillationobject-detection+5 more

Similar Papers

Cite this paper

@article{matsubara2025multitask,
  title  = {A Multi-task Supervised Compression Model for Split Computing},
  author = {Yoshitomo Matsubara and Matteo Mendula and Marco Levorato},
  year   = {2025},
  eprint = {2501.01420},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.01420v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.01420.svg)](https://codeofpaper.com/paper/2501.01420)

Discussion