Debiased Graph Poisoning Attack via Contrastive Surrogate Objective
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNN) are vulnerable to adversarial attacks, which aim to degrade the performance of GNNs through imperceptible changes on the graph. However, we find that in fact the prevalent meta-gradient-based attacks, which utilizes the gradient of the loss w.r.t the adjacency matrix, are biased towards training nodes. That is, their meta-gradient is determined by a training procedure of the surrogate model, which is solely trained on the training nodes. This bias manifests as an uneven perturbation, connecting two nodes when at least one of them is a labeled node, i.e., training node, while it is unlikely to connect two unlabeled nodes. However, these biased attack approaches are sub-optimal as they do not consider flipping edges between two unlabeled nodes at all. This means that they miss the potential attacked edges between unlabeled nodes that significantly alter the representation of a node. In this paper, we investigate the meta-gradients to uncover the root cause of the uneven perturbations of existing attacks. Based on our analysis, we propose a Meta-gradient-based attack method using contrastive surrogate objective (Metacon), which alleviates the bias in meta-gradient using a new surrogate loss. We conduct extensive experiments to show that Metacon outperforms existing meta gradient-based attack methods through benchmark datasets, while showing that alleviating the bias towards training nodes is effective in attacking the graph structure.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 39 references that are in the map. First posted on arXiv 27 Jul 2024.
Builds on
25 of 39 references.
References · 25
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2018Adversarial Attacks on Neural Networks for Graph Datacited by 395
- 2020Graph Structure Learning for Robust Graph Neural Networkscited by 368
- 2018Adversarial Attack on Graph Structured Datacited by 300
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
- 2020GNNGuard: Defending Graph Neural Networks against Adversarial Attackscited by 195
13 more
- 2020Node Similarity Preserving Graph Convolutional Networkscited by 112
- 2016Hiding Individuals and Communities in a Social Networkcited by 77
- 2020Towards More Practical Adversarial Attacks on Graph Neural Networkscited by 76
- 2019A Restricted Black-box Adversarial Framework Towards Attacking Graph Embedding Modelscited by 68
- 2020Reliable Graph Neural Networks via Robust Aggregationcited by 43
- 2023Are Defenses for Graph Neural Networks Robust?cited by 38
- 2022Unsupervised Graph Poisoning Attack via Contrastive Loss Back-propagationcited by 25
- 2021Graph Structural Attack by Perturbing Spectral Distancecited by 16
- 2023Towards Reasonable Budget Allocation in Untargeted Graph Structure Attacks via Gradient Debiascited by 16
- 2023Shift-Robust Molecular Relational Learning with Causal Substructurecited by 15
- 2022Are Gradients on Graph Structure Reliable in Gray-box Attacks?cited by 10
- 2024Self-Guided Robust Graph Structure Refinementcited by 8
- 2023Similarity Preserving Adversarial Graph Contrastive Learningcited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.