Byzantine-Robust Federated Learning

Overview

Byzantine-robust federated learning studies how to train a shared model when some participating clients may be faulty or malicious, without centralizing their data. Common defenses replace simple averaging with coordinate medians or trimmed means, Krum-style distance selection, geometric-median or clustering methods, and trust, anomaly, or history-based screening; newer systems also combine these with secure aggregation, differential privacy, or proofs of correct computation. Methods are tested on non-IID image and text benchmarks, intrusion detection and medical data, and increasingly decentralized, asynchronous, or edge settings, where partial participation and client diversity complicate detection. The central tension is separating malicious updates from legitimate variation while retaining accuracy and convergence: adaptive or coordinated attacks can evade filters, and guarantees often depend on assumptions about attacker numbers, honest-client structure, or available reference data.

Latest papers

CardsList

91 papers7 papers in the last four weeks, down 59% on the four weeks before. 0.1% of all new papers.

  1. Kick Bad Guys Out! Conditionally Activated Anomaly Detection in Federated Learning with Zero-Knowledge Proof Verification

    Oct 6, 2023Shanshan Han, Wenxuan Wu, Baturalp Buyukates +4Byzantine-Robust Federated LearningAdversarial Attacks