REPA: Client Clustering without Training and Data Labels for Improved Federated Learning in Non-IID Settings
Boris Radovi\v{c}, Veljko Pejovi\'c

TL;DR
REPA introduces a novel client clustering method for federated learning that does not require training or labeled data, enabling improved performance in non-IID settings and broader applicability.
Contribution
REPA proposes a supervised autoencoder-based approach for client clustering in federated learning without training or labeled data, expanding use cases.
Findings
Achieves state-of-the-art model performance in non-IID FL scenarios.
Works without client training or labeled data collection.
Effective across multiple datasets.
Abstract
Clustering clients into groups that exhibit relatively homogeneous data distributions represents one of the major means of improving the performance of federated learning (FL) in non-independent and identically distributed (non-IID) data settings. Yet, the applicability of current state-of-the-art approaches remains limited as these approaches cluster clients based on information, such as the evolution of local model parameters, that is only obtainable through actual on-client training. On the other hand, there is a need to make FL models available to clients who are not able to perform the training themselves, as they do not have the processing capabilities required for training, or simply want to use the model without participating in the training. Furthermore, the existing alternative approaches that avert the training still require that individual clients have a sufficient amount of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Advanced Graph Neural Networks
