Deep learning models for graphs have achieved strong performance for the task of node classification. Despite their proliferation, currently there is no study of their robustness to adversarial attacks. Yet, in domains where they are likely to be used, e.g. the web, adversaries are common. Can deep learning models for graphs be easily fooled? In this work, we introduce the first study of adversarial attacks on attributed graphs, specifically focusing on models exploiting ideas of graph convolutions. We generate adversarial perturbations targeting the node's features and the graph structure, thus, taking the dependencies between instances in account. To cope with the underlying discrete domain we propose an efficient algorithm Nettack exploiting incremental computations. Our experimental study shows that accuracy of node classification significantly drops even when performing only few perturbations. Even more, our attacks are transferable: the learned attacks generalize to other state-of-the-art node classification models.

本文主要介绍了第一项针对属性通用图的对抗攻击研究，特别关注利用图卷积思想的模型，在针对测试及训练阶段的攻击中生成针对节点特征和图结构的对抗扰动，并确保这些扰动在保存重要数据特征的同时，不被察觉，旨在帮助更好地理解和缓解目前深度学习模型在对抗环境下的不足。

图数据神经网络的对抗攻击