Fairness-Aware Client Selection for Federated Learning

Yuxin Shi, Zelei Liu, Zhuan Shi, Han Yu
7/20/2023
cs.LGcs.AIcs.DC

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Federated learning (FL) has enabled multiple data owners (a.k.a. FL clients) to train machine learning models collaboratively without revealing private data. Since the FL server can only engage a limited number of clients in each training round, FL client selection has become an important research problem. Existing approaches generally focus on either enhancing FL model performance or enhancing the fair treatment of FL clients. The problem of balancing performance and fairness considerations when selecting FL clients remains open. To address this problem, we propose the Fairness-aware Federated Client Selection (FairFedCS) approach. Based on Lyapunov optimization, it dynamically adjusts FL clients' selection probabilities by jointly considering their reputations, times of participation in FL tasks and contributions to the resulting model performance. By not using threshold-based reputation filtering, it provides FL clients with opportunities to redeem their reputations after a perceived poor performance, thereby further enhancing fair client treatment. Extensive experiments based on real-world multimedia datasets show that FairFedCS achieves 19.6% higher fairness and 0.73% higher test accuracy on average than the best-performing state-of-the-art approach.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{shi2023fairnessaware,
  title  = {Fairness-Aware Client Selection for Federated Learning},
  author = {Yuxin Shi and Zelei Liu and Zhuan Shi and Han Yu},
  year   = {2023},
  eprint = {2307.10738},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.10738v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.10738.svg)](https://codeofpaper.com/paper/2307.10738)

Discussion