Cited by 47Privacy-Preserving Technologies in DataAdversarial Robustness in Machine LearningNetwork Security and Intrusion Detection

Detecting Malicious Model Updates from Federated Learning on Conditional Variational Autoencoder

Gu, Zhipin, Yang, Yuexiang·2021·2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Abstract

In federated learning, the central server combines local model updates from the clients in the network to create an aggregated model. To protect clients' privacy, the server is designed to have no visibility into how these updates are generated. The nature of federated learning makes detecting and defending against malicious model updates a challenging task. Unlike existing works that struggle to defend against Byzantine clients, the paper considers defending against targeted model poisoning attack in the federated learning setting. The adversary aims to reduce the model performance on targeted subtasks while maintaining the main task's performance. This paper proposes Fedcvae, a robust and unsupervised federated learning framework where the central server uses conditional variational autoencoder to detect and exclude malicious model updates. Since the reconstruction error of malicious updates is much larger than that of benign ones, it can be used as an anomaly score. We formulate a dynamic threshold of reconstruction error to differentiate malicious updates from normal ones based on this idea. Fedcvae is tested with extensive experiments on IID and non-IID federated benchmarks, showing a competitive performance over existing aggregation methods under Byzantine attack and targeted model poisoning attack.

Integrity signals

Registry

Crossref · 10.1109/ipdps49936.2021.00075

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Cites

Flagged first, then by citations

3 of the 41 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Gu, Z., & Yang, Y.
Affiliations
National University of Defense Technology (CN)
Venue
2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Publisher
IEEE
Published
2021-05
Pages
671-680
ISSN
1530-2075 (ISSN-L)
OpenAlex
W3177173743
Cited by
47
References
41
Citations by year
2026: 4 · 2025: 6 · 2024: 10 · 2023: 19 · 2022: 7 · 2021: 1
FWCI
4.27
Type
conference paper
Language
en
Open access
closed
Locations
IEEE International Parallel and Distributed Processing Symposium (IPDPS) (publishedVersion)
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 › Computer Networks and Communications › Network Security and Intrusion Detection
Keywords
federated learning, model poisoning, conditional variational autoencoder, reconstruction error, anomaly detection, non-IID data, Byzantine attacks

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