A Four-Pronged Defense Against Byzantine Attacks in Federated Learning
Wei Wan, Shengshan Hu, Minghui Li, Jianrong Lu, Longling Zhang, Leo Yu, Zhang, Hai Jin

TL;DR
This paper introduces FPD, a comprehensive four-pronged defense mechanism for federated learning that effectively counters both non-colluding and colluding Byzantine attacks, significantly improving model robustness and accuracy.
Contribution
The paper proposes a novel four-component defense framework utilizing absolute similarity, client selection, spectral outlier detection, and update denoising to enhance Byzantine attack resilience in federated learning.
Findings
FPD outperforms state-of-the-art defenses by 30% in accuracy.
Effective against both non-colluding and colluding Byzantine attacks.
Robust in IID and non-IID data scenarios.
Abstract
\textit{Federated learning} (FL) is a nascent distributed learning paradigm to train a shared global model without violating users' privacy. FL has been shown to be vulnerable to various Byzantine attacks, where malicious participants could independently or collusively upload well-crafted updates to deteriorate the performance of the global model. However, existing defenses could only mitigate part of Byzantine attacks, without providing an all-sided shield for FL. It is difficult to simply combine them as they rely on totally contradictory assumptions. In this paper, we propose FPD, a \underline{\textbf{f}}our-\underline{\textbf{p}}ronged \underline{\textbf{d}}efense against both non-colluding and colluding Byzantine attacks. Our main idea is to utilize absolute similarity to filter updates rather than relative similarity used in existingI works. To this end, we first propose 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.
