Pith. sign in

REVIEW 1 cited by

Federated Multi-Task Learning

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 1705.10467 v2 pith:ODEL4Q76 submitted 2017-05-30 cs.LG stat.ML

classification cs.LGstat.ML
keywords learningfederatedmethodmulti-taskchallengesdistributedissuessetting
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Federated learning poses new statistical and systems challenges in training machine learning models over distributed networks of devices. In this work, we show that multi-task learning is naturally suited to handle the statistical challenges of this setting, and propose a novel systems-aware optimization method, MOCHA, that is robust to practical systems issues. Our method and theory for the first time consider issues of high communication cost, stragglers, and fault tolerance for distributed multi-task learning. The resulting method achieves significant speedups compared to alternatives in the federated setting, as we demonstrate through simulations on real-world federated datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lazy But Effective: Collaborative Personalized Federated Learning with Heterogeneous Data

    cs.LG 2025-05 conditional novelty 5.0 of 10

    pFedLIA clusters federated learning clients using a cheap 'lazy influence' score, and on CIFAR10/100 and FashionMNIST it matches a perfect-clustering oracle while improving on existing personalized FL baselines by up ...

Pith tools