Defending adversarial attacks in Graph Neural Networks via tensor enhancement

被引:3
作者
Zhang, Jianfu [1 ,3 ]
Hong, Yan [4 ]
Cheng, Dawei [5 ]
Zhang, Liqing [2 ]
Zhao, Qibin [3 ]
机构
[1] Shanghai Jiao Tong Univ, Shanghai, Peoples R China
[2] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
[3] RIKEN AIP, Tokyo, Japan
[4] Ant Grp, Hangzhou, Peoples R China
[5] Tongji Univ, Dept Comp Sci & Technol, Shanghai, Peoples R China
基金
中国国家自然科学基金;
关键词
Graph Neural Networks; Adversarial robustness; Tensor decomposition;
D O I
10.1016/j.patcog.2024.110954
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph Neural Networks (GNNs) have demonstrated remarkable success across diverse fields, yet remain susceptible to subtle adversarial perturbations that significantly degrade performance. Addressing this vulnerability remains a formidable challenge. Current defense strategies focus on edge-specific regularization within adversarial graphs, often overlooking the inter-edge structural dependencies and the interplay of various robustness attributes. This paper introduces a novel tensor-based framework for GNNs, aimed at reinforcing graph robustness against adversarial influences. By employing tensor approximation, our method systematically aggregates and compresses diverse predefined robustness features of adversarial graphs into a low-rank representation. This approach harmoniously combines the integrity of graph structure and robustness characteristics. Comprehensive experiments on real-world graph datasets demonstrate that our framework not only effectively counters diverse types of adversarial attacks but also surpasses existing leading defense mechanisms in performance.
引用
收藏
页数:10
相关论文
共 45 条
[1]  
Adamic L. A., 2005, P 3 INT WORKSH LINK, P36, DOI DOI 10.1145/1134271.1134277
[2]   t-PINE: tensor-based predictable and interpretable node embeddings [J].
Al-Sayouri, Saba A. ;
Gujral, Ekta ;
Koutra, Danai ;
Papalexakis, Evangelos E. ;
Lam, Sarah S. .
SOCIAL NETWORK ANALYSIS AND MINING, 2020, 10 (01)
[3]   Adaptive filters in Graph Convolutional Neural Networks [J].
Apicella, Andrea ;
Isgro, Francesco ;
Pollastro, Andrea ;
Prevete, Roberto .
PATTERN RECOGNITION, 2023, 144
[4]  
Bhojanapalli S, 2015, Arxiv, DOI arXiv:1502.05023
[5]   ANALYSIS OF INDIVIDUAL DIFFERENCES IN MULTIDIMENSIONAL SCALING VIA AN N-WAY GENERALIZATION OF ECKART-YOUNG DECOMPOSITION [J].
CARROLL, JD ;
CHANG, JJ .
PSYCHOMETRIKA, 1970, 35 (03) :283-&
[6]  
Cheng DH, 2016, ADV NEUR IN, V29
[7]  
Comon P., 2009, Tensor decompositions, alternating least squares and other tales, J. Chemom.: J. Chemom. Soc.
[8]  
Dai HJ, 2018, PR MACH LEARN RES, V80
[9]   Topological safeguard for evasion attack interpreting the neural networks' behavior [J].
Echeberria-Barrio, Xabier ;
Gil-Lerchundi, Amaia ;
Mendialdua, Inigo ;
Orduna-Urrutia, Raul .
PATTERN RECOGNITION, 2024, 147
[10]   All You Need Is Low (Rank): Defending Against Adversarial Attacks on Graphs [J].
Entezari, Negin ;
Al-Sayouri, Saba A. ;
Darvishzadeh, Amirali ;
Papalexakis, Evangelos E. .
PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, :169-177