Pith. sign in

REVIEW

AdaBridge: Dynamic Data and Computation Reuse for Efficient Multi-task DNN Co-evolution in Edge Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.00016 v1 pith:4GVJPC53 submitted 2024-05-03 cs.DC

classification cs.DC
keywords multi-taskadabridgedatadnnsevolutionaccuracyco-evolutioncomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Running multi-task DNNs on mobiles is an emerging trend for various applications like autonomous driving and mobile NLP. Mobile DNNs are often compressed to fit the limited resources and thus suffer from degraded accuracy and generalizability due to data drift. DNN evolution, e.g., continuous learning and domain adaptation, has been demonstrated effective in overcoming these issues, mostly for single-task DNN, leaving multi-task DNN evolution an important yet open challenge. To fill up this gap, we propose AdaBridge, which exploits computational redundancies in multi-task DNNs as a unique opportunity for dynamic data and computation reuse, thereby improving training efficacy and resource efficiency among asynchronous multi-task co-evolution in edge systems. Experimental evaluation shows that AdaBridge achieves 11% average accuracy gain upon individual evolution baselines.

Discussion (0). Continue with ORCID to comment.

Pith tools