Self-supervised Adversarial Purification for Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Defending Graph Neural Networks (GNNs) against adversarial attacks requires balancing accuracy and robustness, a trade-off often mishandled by traditional methods like adversarial training that intertwine these conflicting objectives within a single classifier. To overcome this limitation, we propose a self-supervised adversarial purification framework. We separate robustness from the classifier by introducing a dedicated purifier, which cleanses the input data before classification. In contrast to prior adversarial purification methods, we propose GPR-GAE, a novel graph auto-encoder (GAE), as a specialized purifier trained with a self-supervised strategy, adapting to diverse graph structures in a data-driven manner. Utilizing multiple Generalized PageRank (GPR) filters, GPR-GAE captures diverse structural representations for robust and effective purification. Our multi-step purification process further facilitates GPR-GAE to achieve precise graph recovery and robust defense against structural perturbations. Experiments across diverse datasets and attack scenarios demonstrate the state-of-the-art robustness of GPR-GAE, showcasing it as an independent plug-and-play purifier for GNN classifiers.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 33 references that are in the map. First posted on arXiv 22 May 2026.
Builds on
21 of 33 references.
References · 21
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019Graph Neural Networks for Social Recommendationcited by 711
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
9 more
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
- 2021Robustness of Graph Neural Networks at Scalecited by 100
- 2019Graph Adversarial Training: Dynamically Regularizing Based on Graph Structurecited by 93
- 2022What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoderscited by 82
- 2023Are Defenses for Graph Neural Networks Robust?cited by 38
- 2022Spectral Adversarial Training for Robust Graph Neural Networkcited by 12
- 2025Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decompositioncited by 3
- 2026UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Modelscited by 1
Built on by
Not cited yet.