Bayesian Adversarial Attack on Graph Neural Networks (Student Abstract)


  • Xiao Liu East China Normal University
  • Jing Zhao East China Normal University
  • Shiliang Sun East China Normal University



Adversarial attack on graph neural network (GNN) is distinctive as it often jointly trains the available nodes to generate a graph as an adversarial example. Existing attacking approaches usually consider the case that all the training set is available which may be impractical. In this paper, we propose a novel Bayesian adversarial attack approach based on projected gradient descent optimization, called Bayesian PGD attack, which gets more general attack examples than deterministic attack approaches. The generated adversarial examples by our approach using the same partial dataset as deterministic attack approaches would make the GNN have higher misclassification rate on graph node classification. Specifically, in our approach, the edge perturbation Z is used for generating adversarial examples, which is viewed as a random variable with scale constraint, and the optimization target of the edge perturbation is to maximize the KL divergence between its true posterior distribution p(Z|D) and its approximate variational distribution qθ(Z). We experimentally find that the attack performance will decrease with the reduction of available nodes, and the effect of attack using different nodes varies greatly especially when the number of nodes is small. Through experimental comparison with the state-of-the-art attack approaches on GNNs, our approach is demonstrated to have better and robust attack performance.




How to Cite

Liu, X., Zhao, J., & Sun, S. (2020). Bayesian Adversarial Attack on Graph Neural Networks (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 34(10), 13867-13868.



Student Abstract Track