arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.05730cs.LGcs.AIstat.ML

A Survey of Adversarial Learning on Graphs

Sun Yat-sen University(中山大学);Hangzhou Dianzi University of China(杭州电子科技大学);University of Science and Technology of China(中国科学技术大学);Tencent AI Lab(腾讯人工智能实验室)

Liang Chen, Jintang Li, Jiaying Peng, Tao Xie, Zengxu Cao, Kun Xu, Xiangnan He, Zibin Zheng, Bingzhe Wu

英文摘要:

Deep learning models on graphs have achieved remarkable performance in various graph analysis tasks, e.g., node classification, link prediction, and graph clustering. However, they expose uncertainty and unreliability against the well-designed inputs, i.e., adversarial examples. Accordingly, a line of studies has emerged for both attack and defense addressed in different graph analysis tasks, leading to the arms race in graph adversarial learning. Despite the booming works, there still lacks a unified problem definition and a comprehensive review. To bridge this gap, we investigate and summarize the existing works on graph adversarial learning tasks systemically. Specifically, we survey and unify the existing works w.r.t. attack and defense in graph analysis tasks, and give appropriate definitions and taxonomies at the same time. Besides, we emphasize the importance of related evaluation metrics, investigate and summarize them comprehensively. Hopefully, our works can provide a comprehensive overview and offer insights for the relevant researchers. Latest advances in graph adversarial learning are summarized in our GitHub repository https://github.com/EdisonLeeeee/Graph-Adversarial-Learning.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑