Robust Federated Learning with Adaptable Learning Rate
Abstract
Federated learning(FL), one of the most popular distributed machine learning algorithms, allows participants to collaborate on updating models without sharing local data. At the same time, FL is vulnerable to malicious attacks due to the secrecy of the data. Backdoor attacks, as one of many malicious attacks, attempt to add a backdoor to the global model, which will lead to misclassification after activation. Backdoor attacks are difficult to detect. To defend against backdoor attacks, we designed a defense method deployed on the central server side. The method autonomously adjusts the learning rate based on the received parameter signs form all participants to reduce the impact of malicious updates. It is shown experimentally that the method can significantly reduce the impact of backdoor attacks while maintaining high model accuracy on clean datasets when the correct threshold is set.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The defense during the aggregation phase involves filtering out poisoned updates after they have been received by the aggregator.
“The defense during the aggregation phase involves filtering out poisoned updates after they have been received by the aggregator [230], [249], [250].”
From Data and model poisoning backdoor attacks on wireless federated learning, and the defense mechanisms: A comprehensive survey (2024) · cites this paper as [250]
The citation lists haven’t been fetched yet
References 13 · Cited by 2
- Authors
- Zhou, J., Zhong, Z., Wang, J., Zhang, X., Chen, F., & Yan, C.
- Affiliations
- National University of Defense Technology (CN)
- Venue
- 2021 7th International Conference on Big Data and Information Analytics (BigDIA)
- Publisher
- IEEE
- Published
- 2021-10-29
- Pages
- 485-490
- OpenAlex
- W4200091041
- Cited by
- 2
- References
- 13
- Citations by year
- 2025: 1 · 2024: 1
- FWCI
- 0.12
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- International Conference on Big Data and Information Analytics (BigDIA) (publishedVersion)
- Funders
- National Natural Science Foundation of China (62102445)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Keywords
- federated learning, backdoor attacks, adaptive learning rate, robustness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review