Metapath-free adversarial attacks against heterogeneous graph neural networks

Heterogeneous Graph Neural Networks (HeteGNNs) have exhibited remarkable performance by harnessing metapaths, abstract paths comprising node and link types, to capture intricate relationships. Recent studies have underscored the susceptibility of HeteGNNs to adversarial attacks involving minor perturbations such as edge modifications. However, existing attack methods, reliant on manually defined metapaths, may be impractical without domain-specific expertise. Even worse, depending on the metapath setting, the attack performance can vary significantly. In this paper, we find that such instability in attacks may be caused by the type imbalance issue within HeteGNNs, where edge types that exhibit similar performance when utilized individually are treated in a highly imbalanced manner when combined. Based on this finding, we introduce a novel black-box attack method HSA to eliminate the need for manually defined metapaths. Specifically, HSA first partitions the graph into single-edge-type subgraphs and queries their predictions to detail the type imbalance issue within the victim HeteGNN. Subsequently, HSA integrates data-driven prior knowledge by considering gradients and embedding similarities of node pairs to improve perturbation generation. This combined strategy enhances the perturbation generation process from both the target model and data perspectives. Experimental results validate the effectiveness of our approach can even comparable to gray-box attacks. • Our method, unlike the previous attack, does not require manual metapath setup. • Our approach is founded on our discovery called “Type Imbalance Issue”. • Experimental results validate the effectiveness of our approach.

Authors

Institutions

Publication Details

Journal
Information Sciences
Published
2025-04-04
DOI
https://doi.org/10.1016/j.ins.2025.122143
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Metapath-free adversarial attacks against heterogeneous graph neural networks

Yin Jiang, Haoran Li, Qiang Wang, Jingyi Liu et al.
Information Sciences
Adversarial Robustness in Machine Learning
article

Metapath-free adversarial attacks against heterogeneous graph neural networks

Yin Jiang, Haoran Li, Qiang Wang, Jingyi Liu, Long Yin, Jian Xu
article en

Abstract

Heterogeneous Graph Neural Networks (HeteGNNs) have exhibited remarkable performance by harnessing metapaths, abstract paths comprising node and link types, to capture intricate relationships. Recent studies have underscored the susceptibility of HeteGNNs to adversarial attacks involving minor perturbations such as edge modifications. However, existing attack methods, reliant on manually defined metapaths, may be impractical without domain-specific expertise. Even worse, depending on the metapath setting, the attack performance can vary significantly. In this paper, we find that such instability in attacks may be caused by the type imbalance issue within HeteGNNs, where edge types that exhibit similar performance when utilized individually are treated in a highly imbalanced manner when combined. Based on this finding, we introduce a novel black-box attack method HSA to eliminate the need for manually defined metapaths. Specifically, HSA first partitions the graph into single-edge-type subgraphs and queries their predictions to detail the type imbalance issue within the victim HeteGNN. Subsequently, HSA integrates data-driven prior knowledge by considering gradients and embedding similarities of node pairs to improve perturbation generation. This combined strategy enhances the perturbation generation process from both the target model and data perspectives. Experimental results validate the effectiveness of our approach can even comparable to gray-box attacks. • Our method, unlike the previous attack, does not require manual metapath setup. • Our approach is founded on our discovery called “Type Imbalance Issue”. • Experimental results validate the effectiveness of our approach.

Information SciencesVol. 713
Northeastern University (CN)
National Natural Science Foundation of China
Reduced inequalities
Openalex Percentile: Top 97%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.