Perseus: Leveraging Common Data Patterns with Curriculum Learning for More Robust Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) excel at handling graph data but remain vulnerable to adversarial attacks. Existing defense methods typically rely on assumptions like graph sparsity and homophily to either preprocess the graph or guide structure learning. However, preprocessing methods often struggle to accurately distinguish between normal edges and adversarial perturbations, leading to suboptimal results due to the loss of valuable edge information. Robust graph neural network models train directly on graph data affected by adversarial perturbations, without preprocessing. This can cause the model to get stuck in poor local optima, negatively affecting its performance. To address these challenges, we propose Perseus, a novel adversarial defense method based on curriculum learning. Perseus assesses edge difficulty using global homophily and applies a curriculum learning strategy to adjust the learning order, guiding the model to learn the full graph structure while adaptively focusing on common data patterns. This approach mitigates the impact of adversarial perturbations. Experiments show that models trained with Perseus achieve superior performance and are significantly more robust to adversarial attacks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 43 references that are in the map. First posted on arXiv 16 Oct 2024.
Builds on
6 of 43 references.
References · 6
- 2020DeepRobust: A PyTorch Library for Adversarial Attacks and Defensescited by 78
- 2020Adversarial Attacks and Defenses on Graphs: A Review, A Tool and Empirical Studiescited by 42
- 2023Curriculum Graph Machine Learning: A Surveycited by 15
- 2019GraphSAC: Detecting anomalies in large-scale graphscited by 11
- 2019Can Adversarial Network Attack be Defended?cited by 10
- 2019Adversarial Examples on Graph Data: Deep Insights into Attack and Defensecited by 4
Built on by
Not cited yet.