Fair Decentralized Learning
Sayan Biswas, Anne-Marie Kermarrec, Rishi Sharma, Thibaud Trinca, Martijn de Vos

TL;DR
This paper introduces extsc{Facade}, a decentralized clustering algorithm for fair model training in heterogeneous data environments, improving accuracy, fairness, and reducing communication costs.
Contribution
extsc{Facade} is a novel clustering-based decentralized learning algorithm that dynamically assigns nodes to feature-based clusters without prior knowledge, enhancing fairness and efficiency.
Findings
extsc{Facade} outperforms state-of-the-art baselines in accuracy and fairness.
It reduces communication costs by 32.3% on CIFAR-10.
Theoretical convergence of extsc{Facade} is proven.
Abstract
Decentralized learning (DL) is an emerging approach that enables nodes to collaboratively train a machine learning model without sharing raw data. In many application domains, such as healthcare, this approach faces challenges due to the high level of heterogeneity in the training data's feature space. Such feature heterogeneity lowers model utility and negatively impacts fairness, particularly for nodes with under-represented training data. In this paper, we introduce \textsc{Facade}, a clustering-based DL algorithm specifically designed for fair model training when the training data exhibits several distinct features. The challenge of \textsc{Facade} is to assign nodes to clusters, one for each feature, based on the similarity in the features of their local data, without requiring individual nodes to know apriori which cluster they belong to. \textsc{Facade} (1) dynamically assigns…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy, Security, and Data Protection · Access Control and Trust
