REVIEW 2 cited by
Find Your Friends: Personalized Federated Learning with the Right Collaborators
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
read the original abstract
In the traditional federated learning setting, a central server coordinates a network of clients to train one global model. However, the global model may serve many clients poorly due to data heterogeneity. Moreover, there may not exist a trusted central party that can coordinate the clients to ensure that each of them can benefit from others. To address these concerns, we present a novel decentralized framework, FedeRiCo, where each client can learn as much or as little from other clients as is optimal for its local data distribution. Based on expectation-maximization, FedeRiCo estimates the utilities of other participants' models on each client's data so that everyone can select the right collaborators for learning. As a result, our algorithm outperforms other federated, personalized, and/or decentralized approaches on several benchmark datasets, being the only approach that consistently performs better than training with local data only.
Forward citations
Cited by 2 Pith papers
-
pFedWN: A Personalized Federated Learning Framework for D2D Wireless Networks with Heterogeneous Data
pFedWN combines channel-aware neighbor selection with an EM-based model weighting step to personalize federated learning over server-free D2D wireless networks.
-
S-VOTE: Similarity-based Voting for Client Selection in Decentralized Federated Learning
S-VOTE selects clients by cosine similarity of model weights and lets low-vote clients sometimes skip training, reducing communication and energy while improving non-IID accuracy in some settings.
Discussion (0). Continue with ORCID to comment.