Bandits for Structure Perturbation-based Black-box Attacks to Graph Neural Networks with Theoretical Guarantees
Binghui Wang, Youqi Li, and Pan Zhou

TL;DR
This paper introduces a novel black-box attack method on graph neural networks using bandit optimization, providing theoretical guarantees and demonstrating effectiveness across multiple datasets.
Contribution
It proposes the first bandit-based online attack framework for structure perturbation in GNNs with proven sublinear query complexity.
Findings
Effective attack performance on citation and image graphs
The attack requires fewer queries compared to baseline methods
Theoretical guarantees ensure attack efficiency
Abstract
Graph neural networks (GNNs) have achieved state-of-the-art performance in many graph-based tasks such as node classification and graph classification. However, many recent works have demonstrated that an attacker can mislead GNN models by slightly perturbing the graph structure. Existing attacks to GNNs are either under the less practical threat model where the attacker is assumed to access the GNN model parameters, or under the practical black-box threat model but consider perturbing node features that are shown to be not enough effective. In this paper, we aim to bridge this gap and consider black-box attacks to GNNs with structure perturbation as well as with theoretical guarantees. We propose to address this challenge through bandit techniques. Specifically, we formulate our attack as an online optimization with bandit feedback. This original problem is essentially NP-hard due to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Machine Learning in Materials Science · Adversarial Robustness in Machine Learning
