arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.08412cs.LGcs.CRstat.ML
收藏

基于元学习的图神经网络对抗攻击

Adversarial Attacks on Graph Neural Networks via Meta Learning

Technical University of Munich(慕尼黑工业大学)

Daniel Zügner, Stephan Günnemann

AI总结:

该研究针对图神经网络鲁棒性不明的问题,提出基于元梯度优化图结构的训练阶段对抗攻击方法,证实小幅扰动可大幅降低模型性能且无需访问目标分类器。

摘要:

用于图的深度学习模型已在诸多任务上刷新了当前最优性能。尽管近年成果显著,人们对其鲁棒性仍知之甚少。我们针对节点分类任务下的图神经网络,研究了训练阶段扰动离散图结构的攻击方法。核心思路是利用元梯度求解训练阶段攻击对应的双层优化问题,本质上将图视作待优化的超参数。实验表明,小幅图扰动会持续导致图卷积网络性能大幅下降,甚至可迁移至无监督嵌入任务中。值得注意的是,我们的算法生成的扰动能误导图神经网络,使其表现差于忽略所有关系信息的简单基线模型。我们的攻击无需知晓或访问目标分类器的相关信息。

英文摘要:

Deep learning models for graphs have advanced the state of the art on many tasks. Despite their recent success, little is known about their robustness. We investigate training time attacks on graph neural networks for node classification that perturb the discrete graph structure. Our core principle is to use meta-gradients to solve the bilevel problem underlying training-time attacks, essentially treating the graph as a hyperparameter to optimize. Our experiments show that small graph perturbations consistently lead to a strong decrease in performance for graph convolutional networks, and even transfer to unsupervised embeddings. Remarkably, the perturbations created by our algorithm can misguide the graph neural networks such that they perform worse than a simple baseline that ignores all relational information. Our attacks do not assume any knowledge about or access to the target classifiers.

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

↑