返回
Simple and Efficient Partial Graph Adversarial Attack: A New Perspective
DOI:10.1109/TKDE.2024.3364972.png)
摘要
En 中文
As the study of graph neural networks becomes more intensive and comprehensive, their robustness and security have received great research interest. The existing global attack methods treat all nodes in the graph as their attack targets. Although existing methods have achieved excellent results, there is still considerable space for improvement. The key problem is that the current approaches rigidly follow the definition of global attacks. They ignore an important issue, i.e., different nodes have different robustness and are not equally resilient to attacks. From a global attacker's view, we should arrange the attack budget wisely, rather than wasting them on highly robust nodes. To this end, we propose a totally new method named partial graph attack (PGA), which selects the vulnerable nodes as attack targets. First, to select the vulnerable items, we propose a hierarchical target selection policy, which allows attackers to only focus on easy-to-attack nodes. Then, we propose a cost-effective anchor-picking policy to pick the most promising anchors for adding or removing edges, and a more aggressive iterative greedy-based attack method to perform more efficient attacks. Extensive experimental results demonstrate that PGA can achieve significant improvements in both attack effect and attack efficiency compared to existing graph global attack methods.
Keyword:
Electronics packaging
Robustness
Graph neural networks
Task analysis
Measurement
Iterative methods
Data models
Graph neural network
graph adversarial attack
partial attack
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Conjugated heat transfer and temperature distributions in a gas turbine combustion liner under base-load operation基本负荷运行下燃气轮机燃烧衬里中的共轭传热和温度分布
Welding characteristics of aluminum, copper, nickel and aluminum alloy with alumina coating using ultrasonic complex vibration welding equipments铝、铜、镍及铝合金氧化铝涂层超声复合振动焊接特性研究

