TL;DR
This paper investigates the vulnerability of Graph Neural Networks to a highly limited single node injection attack, proposing an optimization-based method and a more efficient G-NIA model that significantly outperforms existing methods.
Contribution
It introduces the first study of single node injection evasion attacks on GNNs and proposes a novel, efficient attack model G-NIA that surpasses state-of-the-art baselines.
Findings
100% attack success on some datasets with just one injected node
G-NIA is 500 times faster than optimization-based methods
G-NIA outperforms existing attack methods in effectiveness
Abstract
Node injection attack on Graph Neural Networks (GNNs) is an emerging and practical attack scenario that the attacker injects malicious nodes rather than modifying original nodes or edges to affect the performance of GNNs. However, existing node injection attacks ignore extremely limited scenarios, namely the injected nodes might be excessive such that they may be perceptible to the target GNN. In this paper, we focus on an extremely limited scenario of single node injection evasion attack, i.e., the attacker is only allowed to inject one single node during the test phase to hurt GNN's performance. The discreteness of network structure and the coupling effect between network structure and node features bring great challenges to this extremely limited scenario. We first propose an optimization-based method to explore the performance upper bound of single node injection evasion attack.…
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
MethodsGeneralizable Node Injection Attack
