Unifying Adversarial Perturbation for Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
This paper studies the vulnerability of Graph Neural Networks (GNNs) to adversarial attacks on node features and graph structure. Various methods have implemented adversarial training to augment graph data, aiming to bolster the robustness and generalization of GNNs. These methods typically involve applying perturbations to the node feature, weights, or graph structure and subsequently minimizing the loss by learning more robust graph model parameters under the adversarial perturbations. Despite the effectiveness of adversarial training in enhancing GNNs' robustness and generalization abilities, its application has been largely confined to specific datasets and GNN types. In this paper, we propose a novel method, PerturbEmbedding, that integrates adversarial perturbation and training, enhancing GNNs' resilience to such attacks and improving their generalization ability. PerturbEmbedding performs perturbation operations directly on every hidden embedding of GNNs and provides a unified framework for most existing perturbation strategies/methods. We also offer a unified perspective on the forms of perturbations, namely random and adversarial perturbations. Through experiments on various datasets using different backbone models, we demonstrate that PerturbEmbedding significantly improves both the robustness and generalization abilities of GNNs, outperforming existing methods. The rejection of both random (non-targeted) and adversarial (targeted) perturbations further enhances the backbone model's performance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 30 Aug 2025.
Builds on
28 of 44 references.
References · 28
- 2017Graph Attention Networkscited by 8,923
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
- 2019Adversarial Training for Free!cited by 643
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
- 2020Graph Structure Learning for Robust Graph Neural Networkscited by 371
16 more
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 311
- 2018Adversarial Attack on Graph Structured Datacited by 301
- 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
- 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
- 2018Adversarial Attack and Defense on Graph Data: A Surveycited by 167
- 2018Adversarial Attacks on Node Embeddings via Graph Poisoningcited by 109
- 2019Graph Adversarial Training: Dynamically Regularizing Based on Graph Structurecited by 93
- 2019Certifiable Robustness and Robust Training for Graph Convolutional Networkscited by 59
- 2019Batch Virtual Adversarial Training for Graph Convolutional Networkscited by 33
- 2019Adversarial Training Methods for Network Embeddingcited by 26
- 2021CAP: Co-Adversarial Perturbation on Weights and Features for Improving Generalization of Graph Neural Networkscited by 15
- 2024Mitigating the Backdoor Effect for Multi-Task Model Merging via Safety-Aware Subspacecited by 14
- 2024Leveraging Invariant Principle for Heterophilic Graph Structure Distribution Shiftscited by 6
- 2025Adversarial Cooperative Rationalization: The Risk of Spurious Correlations in Even Clean Datasetscited by 6
- 2024Discovering Invariant Neighborhood Patterns for Heterophilic Graphscited by 4
Built on by
Citing papers per year: 2025: 1.
1 paper.