Two-level adversarial attacks for graph neural networks

被引:2
作者
Song, Chengxi [1 ]
Niu, Lingfeng [2 ]
Lei, Minglong [3 ]
机构
[1] Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
[2] Univ Chinese Acad Sci, Sch Econ & Management, Beijing 100190, Peoples R China
[3] Beijing Univ Technol, Fac Informat Technol, Beijing 100124, Peoples R China
基金
中国国家自然科学基金;
关键词
Adversarial attacks; Graph neural networks; Contrastive learning; Explainability; CLASSIFICATION;
D O I
10.1016/j.ins.2023.119877
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph neural networks (GNNs) have achieved significant success in numerous graph-based applications. Unfortunately, they are sensitive to adversarial examples generated by modifying graphs with imperceptible perturbations. Therefore, researchers develop attack models to evaluate the robustness of GNNs or design corresponding defense models. However, traditional attack models can hardly determine the importance of perturbed graph structures, where the selection of attack targets lacks explainability. Moreover, these attack models are mainly designed for certain graph-learning tasks. In this study, we propose a two-level adversarial attack framework that reconciles task-and feature-level attacks on GNNs. First, instead of using only adversarial examples, we introduce a dual-view pipeline with two task-level optimization objectives that consider the original and adversarial examples separately. We theoretically demonstrate that this simple yet powerful loss not only improves attack performance but also exhibits strong explainability. Second, we propose a feature-level attack framework based on contrastive learning in which adversarial attacks are applied to the learned features. Our theoretical results imply that contrastive learning between original and adversarial examples can destroy the representation and discriminative abilities of GNNs. Experimental results for several datasets and different GNN architectures demonstrate the effectiveness of the proposed method.
引用
收藏
页数:17
相关论文
共 47 条
[1]  
Adamic L., 2005, P 3 INT WORKSHOP LIN, P36, DOI DOI 10.1145/1134271.1134277
[2]  
Bojchevski A., 2018, ICLR
[3]  
Bojchevski A, 2019, PR MACH LEARN RES, V97
[4]   EGC2: Enhanced graph classification with easy graph compression [J].
Chen, Jinyin ;
Xiong, Haiyang ;
Zheng, Haibin ;
Zhang, Dunjie ;
Zhang, Jian ;
Jia, Mingwei ;
Liu, Yi .
INFORMATION SCIENCES, 2023, 629 :376-397
[5]   MGA: Momentum Gradient Attack on Network [J].
Chen, Jinyin ;
Chen, Yixian ;
Zheng, Haibin ;
Shen, Shijing ;
Yu, Shanqing ;
Zhang, Dan ;
Xuan, Qi .
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2021, 8 (01) :99-109
[6]  
Croce F, 2020, PR MACH LEARN RES, V119
[7]  
Dai HJ, 2018, PR MACH LEARN RES, V80
[8]  
Gilmer J, 2017, PR MACH LEARN RES, V70
[9]  
Hamilton WL, 2017, ADV NEUR IN, V30
[10]  
Hassani K, 2020, PR MACH LEARN RES, V119