mlsanityData to 7 Oct 2026

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

arXiv 2402.04409 ↗First posted 6 Feb 2024cs.LG cs.AI cs.CRcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 15 of its 31 references that are in the map. First posted on arXiv 6 Feb 2024.

Builds on

15 of 31 references.

References · 15

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018How To Backdoor Federated Learningcited by 745
  3. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  4. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  5. 2019Federated Learning in Mobile Edge Networks: A Comprehensive Surveycited by 407
  6. 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
  7. 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
  8. 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
  9. 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
  10. 2020A Principled Approach to Data Valuation for Federated Learningcited by 127
  11. 2019Measure Contribution of Participants in Federated Learningcited by 78
  12. 2021GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learningcited by 73
3 more
  1. 2020Collaborative Machine Learning with Incentive-Aware Model Rewardscited by 71
  2. 2020Fast-Convergent Federated Learning with Adaptive Weightingcited by 67
  3. 2018Model-based Pricing for Machine Learning in a Data Marketplacecited by 37

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.