Towards Fair, Robust and Efficient Client Contribution Evaluation in Federated Learning

Meiying Zhang, Huan Zhao, Sheldon Ebron, Kan Yang
2/6/2024
cs.LGcs.AIcs.CR

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

The performance of clients in Federated Learning (FL) can vary due to various reasons. Assessing the contributions of each client is crucial for client selection and compensation. It is challenging because clients often have non-independent and identically distributed (non-iid) data, leading to potentially noisy or divergent updates. The risk of malicious clients amplifies the challenge especially when there's no access to clients' local data or a benchmark root dataset. In this paper, we introduce a novel method called Fair, Robust, and Efficient Client Assessment (FRECA) for quantifying client contributions in FL. FRECA employs a framework called FedTruth to estimate the global model's ground truth update, balancing contributions from all clients while filtering out impacts from malicious ones. This approach is robust against Byzantine attacks and incorporates a Byzantine-resilient aggregation algorithm. FRECA is also efficient, as it operates solely on local model updates and requires no validation operations or datasets. Our experimental results show that FRECA can accurately and efficiently quantify client contributions in a robust manner.

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. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

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

Similar Papers

Cite this paper

@article{zhang2024towards,
  title  = {Towards Fair, Robust and Efficient Client Contribution Evaluation in Federated Learning},
  author = {Meiying Zhang and Huan Zhao and Sheldon Ebron and Kan Yang},
  year   = {2024},
  eprint = {2402.04409},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.04409v1}
}

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/2402.04409.svg)](https://codeofpaper.com/paper/2402.04409)

Discussion