Saved in:
Bibliographic Details
Main Authors: Wang, Yuling, Chen, Zihui, Jiao, Pengfei, Wang, Xiao
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.07428
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916785131880448
author Wang, Yuling
Chen, Zihui
Jiao, Pengfei
Wang, Xiao
author_facet Wang, Yuling
Chen, Zihui
Jiao, Pengfei
Wang, Xiao
contents Heterogeneous Graph Neural Networks (HGNNs) are vulnerable, highlighting the need for tailored attacks to assess their robustness and ensure security. However, existing HGNN attacks often require complex retraining of parameters to generate specific perturbations for new scenarios. Recently, foundation models have opened new horizons for the generalization of graph neural networks by capturing shared semantics across various graph distributions. This leads us to ask:Can we design a foundation attack model for HGNNs that enables generalizable perturbations across different HGNNs, and quickly adapts to new heterogeneous graphs (HGs)? Empirical findings reveal that, despite significant differences in model design and parameter space, different HGNNs surprisingly share common vulnerability patterns from a relation-aware perspective. Therefore, we explore how to design foundation HGNN attack criteria by mining shared attack units. In this paper, we propose a novel relation-wise heterogeneous graph foundation attack model, HeTa. We introduce a foundation surrogate model to align heterogeneity and identify the importance of shared relation-aware attack units. Building on this, we implement a serialized relation-by-relation attack based on the identified relational weights. In this way, the perturbation can be transferred to various target HGNNs and easily fine-tuned for new HGs. Extensive experiments exhibit powerful attack performances and generalizability of our method.
format Preprint
id arxiv_https___arxiv_org_abs_2506_07428
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model
Wang, Yuling
Chen, Zihui
Jiao, Pengfei
Wang, Xiao
Artificial Intelligence
Machine Learning
Heterogeneous Graph Neural Networks (HGNNs) are vulnerable, highlighting the need for tailored attacks to assess their robustness and ensure security. However, existing HGNN attacks often require complex retraining of parameters to generate specific perturbations for new scenarios. Recently, foundation models have opened new horizons for the generalization of graph neural networks by capturing shared semantics across various graph distributions. This leads us to ask:Can we design a foundation attack model for HGNNs that enables generalizable perturbations across different HGNNs, and quickly adapts to new heterogeneous graphs (HGs)? Empirical findings reveal that, despite significant differences in model design and parameter space, different HGNNs surprisingly share common vulnerability patterns from a relation-aware perspective. Therefore, we explore how to design foundation HGNN attack criteria by mining shared attack units. In this paper, we propose a novel relation-wise heterogeneous graph foundation attack model, HeTa. We introduce a foundation surrogate model to align heterogeneity and identify the importance of shared relation-aware attack units. Building on this, we implement a serialized relation-by-relation attack based on the identified relational weights. In this way, the perturbation can be transferred to various target HGNNs and easily fine-tuned for new HGs. Extensive experiments exhibit powerful attack performances and generalizability of our method.
title HeTa: Relation-wise Heterogeneous Graph Foundation Attack Model
topic Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2506.07428