Value at Adversarial Risk: A Graph Defense Strategy against Cost-Aware Attacks

被引:0
作者
Liao, Junlong [1 ]
Fu, Wenda [1 ]
Wang, Cong [2 ]
Wei, Zhongyu [1 ]
Xu, Jiarong [1 ]
机构
[1] Fudan Univ, Shanghai, Peoples R China
[2] Peking Univ, Beijing, Peoples R China
来源
THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 12 | 2024年
基金
中国国家自然科学基金;
关键词
NETWORK;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep learning methods on graph data have achieved remarkable efficacy across a variety of real-world applications, such as social network analysis and transaction risk detection. Nevertheless, recent studies have illuminated a concerning fact: even the most expressive Graph Neural Networks (GNNs) are vulnerable to graph adversarial attacks. While several methods have been proposed to enhance the robustness of GNN models against adversarial attacks, few have focused on a simple yet realistic approach: valuing the adversarial risks and focused safeguards at the node level. This empowers defenders to allocate heightened security level to vulnerable nodes, while lower to robust nodes. With this new perspective, we propose a novel graph defense strategy RisKeeper, such that the adversarial risk can be directly kept in the input graph. We start at valuing the adversarial risk, by introducing a cost-aware gradient-based graph adversarial attack that takes into account not only cost avoidance and compliance with cost budgets but also addresses the challenges posed by discrete graph data. Subsequently, we present a learnable approach to ascertain the ideal security level for each individual node by solving a bi-level optimization problem. Through extensive experiments on four real-world datasets, we demonstrate that our method achieves superior performance surpassing state-of-the-art methods. Our in-depth case studies provide further insights into vulnerable and robust structural patterns, serving as inspiration for practitioners to exercise heightened vigilance.
引用
收藏
页码:13763 / 13771
页数:9
相关论文
共 35 条
[1]  
Arghal Raghu, 2022, PR MACH LEARN RES, V168
[2]  
Boyd S., 2004, CONVEX OPTIMIZATION
[3]  
Chen L, 2021, PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, P2249
[4]   Deep Community Detection [J].
Chen, Pin-Yu ;
Hero, Alfred O., III .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (21) :5706-5719
[5]  
Dai Enyan, 2022, ARXIV
[6]   Adversarial Training Methods for Network Embedding [J].
Dai, Quanyu ;
Shen, Xiao ;
Zhang, Liang ;
Li, Qiang ;
Wang, Dan .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :329-339
[7]   Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters [J].
Dou, Yingtong ;
Liu, Zhiwei ;
Sun, Li ;
Deng, Yutong ;
Peng, Hao ;
Yu, Philip S. .
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, :315-324
[8]   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
[9]   A combinatorial approach to graphlet counting [J].
Hocevar, Tomaz ;
Demsar, Janez .
BIOINFORMATICS, 2014, 30 (04) :559-565
[10]   Drug-target affinity prediction using graph neural network and contact maps [J].
Jiang, Mingjian ;
Li, Zhen ;
Zhang, Shugang ;
Wang, Shuang ;
Wang, Xiaofeng ;
Yuan, Qing ;
Wei, Zhiqiang .
RSC ADVANCES, 2020, 10 (35) :20701-20712