Byzantine-Resilient Federated Learning via QUBO-Based Client Selection on Quantum Annealers
Andras Ferenczi (1), Sutapa Samanta (1), Dagen Wang (1), Jason Qizhe Qin (2) ((1) American Express Co., (2) Columbia University)

TL;DR
This paper introduces a quantum annealing-based client selection method for federated learning that enhances Byzantine attack detection, especially against complex adversarial strategies, by formulating the problem as a QUBO and combining it with ensemble techniques.
Contribution
It proposes a novel QUBO formulation for client selection in federated learning and a MultiSignal ensemble to improve Byzantine attack detection at scale.
Findings
QUBO outperforms MultiKrum on advanced Byzantine attacks at small scale.
MultiSignal ensemble improves detection accuracy at larger client scales.
QUBO and MultiSignal are complementary, enhancing robustness in federated learning.
Abstract
Federated Learning (FL) trains a global model across decentralized clients while preserving data privacy, but at scale it is vulnerable to malicious updates. Byzantine-resilient aggregation methods such as MultiKrum score gradients against their nearest neighbors and can miss malicious updates that preserve the statistical properties of honest ones. We propose a quantum annealing approach that reformulates client selection as a Quadratic Unconstrained Binary Optimization (QUBO) problem, encoding pairwise distances into a cost function solved by quantum annealers (QA). Unlike MultiKrum's greedy per-client scoring, the QUBO formulation jointly optimizes over all subsets to find the mutually closest group of clients. At small scale (15 clients), QUBO outperforms MultiKrum on the most challenging Byzantine attacks: e.g., Advanced LIE is detected with 95.11% accuracy versus 81.33% on…
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.
