On Provable Backdoor Defense in Collaborative Learning
Ximing Qiao, Yuhua Bai, Siping Hu, Ang Li, Yiran Chen, Hai Li

TL;DR
This paper introduces a new provable defense framework for backdoor attacks in collaborative learning, leveraging code design principles to improve data utilization and detect malicious users effectively.
Contribution
It generalizes subset aggregation methods using code design, providing theoretical bounds and optimal codes for backdoor defense in collaborative learning.
Findings
Outperforms baseline methods on non-IID datasets
Optimal codes improve data utilization and attack detection
Integration with coding theory enhances backdoor attack countermeasures
Abstract
As collaborative learning allows joint training of a model using multiple sources of data, the security problem has been a central concern. Malicious users can upload poisoned data to prevent the model's convergence or inject hidden backdoors. The so-called backdoor attacks are especially difficult to detect since the model behaves normally on standard test data but gives wrong outputs when triggered by certain backdoor keys. Although Byzantine-tolerant training algorithms provide convergence guarantee, provable defense against backdoor attacks remains largely unsolved. Methods based on randomized smoothing can only correct a small number of corrupted pixels or labels; methods based on subset aggregation cause a severe drop in classification accuracy due to low data utilization. We propose a novel framework that generalizes existing subset aggregation methods. The framework shows that…
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
TopicsAdversarial Robustness in Machine Learning · Advanced Malware Detection Techniques · Internet Traffic Analysis and Secure E-voting
MethodsRandomized Smoothing
