Adversarial Label-Flipping Attack and Defense for Graph Neural Networks
Abstract
With the great popularity of Graph Neural Networks (GNNs), the robustness of GNNs to adversarial attacks has received increasing attention. However, existing works neglect adversarial label-flipping attacks, where the attacker can manipulate an unnoticeable fraction of training labels. Exploring the robustness of GNNs to label-flipping attacks is highly critical, especially when labels are collected from external sources and false labels are easy to inject (e.g., recommendation systems). In this work, we introduce the first study of adversarial label-flipping attacks on GNNs. We propose an effective attack model LafAK based on approximated closed form of GNNs and continuous surrogate of non-differentiable objective, efficiently generating attacks via gradient-based optimizers. Furthermore, we show that one key reason for the vulnerability of GNNs to label-flipping attack is overfitting to flipped nodes. Based on this observation, we propose a defense framework which introduces a community-preserving self-supervised task as regularization to avoid overfitting. We demonstrate the effectiveness of our proposed attack model to GNNs on four real-world datasets. The effectiveness of our defense framework is also well validated by the substantial improvements of defense based GNN and its variants under label-flipping attacks.
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?
In label-flipping-based backdoor attacks, the training data set under the targeted label is replaced by the backdoored data set.
“In label-flipping-based backdoor attacks, the training data set under the targeted label is replaced by the backdoored data set [162].”
From Data and model poisoning backdoor attacks on wireless federated learning, and the defense mechanisms: A comprehensive survey (2024) · cites this paper as [162]
The citation lists haven’t been fetched yet
References 43 · Cited by 74
- Authors
- Zhang, M., Hu, L., Shi, C., & Wang, X.
- Affiliations
- Beijing University of Posts and Telecommunications (CN)
- Venue
- 2020 IEEE International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2020-11
- Volume
- 2020
- Pages
- 791-800
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W3127927415
- Cited by
- 74
- References
- 43
- Citations by year
- 2026: 8 · 2025: 25 · 2024: 14 · 2023: 16 · 2022: 7 · 2021: 4
- FWCI
- 2.58
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- Proceedings (publishedVersion)
- IEEE Conference Proceedings
- Funders
- National Natural Science Foundation of China (61772082,61806020,61702296)
- National Key Research and Development Program of China (2018YFB1402600)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Keywords
- graph neural networks, adversarial robustness, attack models, overfitting, regularization
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