Adversarial Attack on Graph Neural Networks as An Influence Maximization Problem
Graph neural networks (GNNs) have attracted increasing interests. With broad deployments of GNNs in real-world applications, there is an urgent need for understanding the robustness of GNNs under adversarial attacks, especially in realistic setups. In this work, we study the problem of attacking GNNs in a restricted and realistic setup, by perturbing the features of a small set of nodes, with no access to model parameters and model predictions. Our formal analysis draws a connection between this type of attacks and an influence maximization problem on the graph. This connection not only enhances our understanding on the problem of adversarial attack on GNNs, but also allows us to propose a group of effective and practical attack strategies. Our experiments verify that the proposed attack strategies significantly degrade the performance of three popular GNN models and outperform baseline adversarial attack strategies.
Code (2)
Tasks
Adversarial AttackSimilar Papers 제목 키워드 기반
Black-Box Adversarial Attacks on Graph Neural Networks as An Influence Maximization Problem
Graph neural networks (GNNs) have attracted increasing interests. With broad deployments of GNNs in real-world applications, there is an urgent need for understanding the robustness of GNNs under adversarial attacks, esp…
Adversarial AttackGAIM: Attacking Graph Neural Networks via Adversarial Influence Maximization
Recent studies show that well-devised perturbations on graph structures or node features can mislead trained Graph Neural Network (GNN) models. However, these methods often overlook practical assumptions, over-rely on he…
Adversarial AttackGraph Neural NetworkAdversarial Graph Embeddings for Fair Influence Maximization over Social Networks
Influence maximization is a widely studied topic in network science, where the aim is to reach the maximum possible number of nodes, while only targeting a small initial set of individuals. It has critical applications i…
ClusteringFairnessGraph EmbeddingMarketingAdversarial Influence Maximization
We consider the problem of influence maximization in fixed networks for contagion models in an adversarial setting. The goal is to select an optimal set of nodes to seed the influence process, such that the number of inf…
Adversarial Attack against Cross-lingual Knowledge Graph Alignment
Recent literatures have shown that knowledge graph (KG) learning models are highly vulnerable to adversarial attacks. However, there is still a paucity of vulnerability analyses of cross-lingual entity alignment under ad…
Adversarial AttackEntity Alignment