Pith. sign in

REVIEW

Adaptive Scheduling for Machine Learning Tasks over Networks

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 2101.10007 v1 pith:AGZNBM6W submitted 2021-01-25 cs.LG cs.SYeess.SYmath.OC

classification cs.LGcs.SYeess.SYmath.OC
keywords learningtasksdataadaptivealgorithmsresourcesschedulingsmart
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A key functionality of emerging connected autonomous systems such as smart transportation systems, smart cities, and the industrial Internet-of-Things, is the ability to process and learn from data collected at different physical locations. This is increasingly attracting attention under the terms of distributed learning and federated learning. However, in this setup data transfer takes place over communication resources that are shared among many users and tasks or subject to capacity constraints. This paper examines algorithms for efficiently allocating resources to linear regression tasks by exploiting the informativeness of the data. The algorithms developed enable adaptive scheduling of learning tasks with reliable performance guarantees.

Discussion (0). Sign in to comment.

Pith tools