Pith. sign in

REVIEW

Multi-Model Federated Learning with Provable Guarantees

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 2207.04330 v6 pith:O4PVF6TS submitted 2022-07-09 cs.LG cs.DCmath.OCstat.ML

classification cs.LGcs.DCmath.OCstat.ML
keywords multi-modelfederatedlearningconvexguaranteesmodelprovabletraining
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated Learning (FL) is a variant of distributed learning where edge devices collaborate to learn a model without sharing their data with the central server or each other. We refer to the process of training multiple independent models simultaneously in a federated setting using a common pool of clients as multi-model FL. In this work, we propose two variants of the popular FedAvg algorithm for multi-model FL, with provable convergence guarantees. We further show that for the same amount of computation, multi-model FL can have better performance than training each model separately. We supplement our theoretical results with experiments in strongly convex, convex, and non-convex settings.

Discussion (0). Continue with ORCID to comment.

Pith tools