Fed-Credit: Robust Federated Learning with Credibility Management
Jiayan Chen, Zhirong Qian, Tianhui Meng, Xitong Gao, Tian Wang, Weijia, Jia

TL;DR
Fed-Credit introduces a credibility-based federated learning method that enhances robustness against malicious attacks without prior knowledge of client behavior, maintaining efficiency and high accuracy.
Contribution
This paper proposes Fed-Credit, a novel credibility management scheme for federated learning that does not require prior attack knowledge and effectively mitigates malicious client contributions.
Findings
Outperforms existing methods in accuracy under attack scenarios.
Maintains low computational complexity of O(n).
Significantly improves performance on Non-IID CIFAR-10 with data poisoning attacks.
Abstract
Aiming at privacy preservation, Federated Learning (FL) is an emerging machine learning approach enabling model training on decentralized devices or data sources. The learning mechanism of FL relies on aggregating parameter updates from individual clients. However, this process may pose a potential security risk due to the presence of malicious devices. Existing solutions are either costly due to the use of compute-intensive technology, or restrictive for reasons of strong assumptions such as the prior knowledge of the number of attackers and how they attack. Few methods consider both privacy constraints and uncertain attack scenarios. In this paper, we propose a robust FL approach based on the credibility management scheme, called Fed-Credit. Unlike previous studies, our approach does not require prior knowledge of the nodes and the data distribution. It maintains and employs a…
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
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Complexity and Algorithms in Graphs
