arXiv AI

Let Prompts Bridge Defense Knowledge: Transferable Graph Purification via Vulnerability-Aware GPL

arXiv Machine Learning
Sep 2

MUGEN: Generating Unlearnable Graph Examples for Multiple Learning Tasks

MUGEN is a framework that generates unlearnable graph examples capable of protecting multiple downstream tasks—node classification, graph classification, and link prediction—simultaneously. It achieves this by perturbing a single clean dataset with a shared GNN encoder and task‑specific heads, guided by a Task‑Aligned Separability Objective (TASO) and a Type‑Adaptive Perturbation (TAP) that handles both discrete and continuous node attributes. Experiments on five benchmarks, four GNN backbones, and three learning paradigms show that MUGEN’s perturbations transfer across models and remain effective even under adversarial training and data augmentation.

By Ziyan Liu, Chengshuai Zhao, Huan Liu
arXiv AI
Sep 11

Kernel-Complexity Edge Sanitization for Training-Free Defense against Structural Graph Attacks

Kernel-Complexity Edge Sanitization (KCES) is a training‑free, model‑agnostic defense for Graph Neural Networks that identifies and removes edges with high Kernel‑Complexity (KC) scores, which are indicative of structural influence on the graph kernel complexity metric. KCES leverages a theoretical upper bound on GNN test error derived from the graph Gram matrix to compute edge‑specific KC scores, pruning edges that are empirically enriched with adversarial perturbations. The method is computationally efficient, scalable to large graphs, and consistently outperforms representative robust baselines across diverse attack settings without requiring retraining.

By Yaning Jia, Shenyang Deng, Yaoqing Yang, Chiyu Ma, Wenxuan Xu, Soroush Vosoughi
arXiv Machine Learning
Jun 8

ADAGE: Active Defenses Against GNN Extraction

arXiv:2503. 00065v4 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) achieve high performance in various real-world applications, such as drug discovery, traffic states prediction, and recommendation systems.

By Jing Xu, Franziska Boenisch, Adam Dziedzic
arXiv Machine Learning
Jul 9

Structural Adversarial Attacks on Relational Deep Learning under Integrity Constraints

arXiv:2607. 07089v1 Announce Type: new Abstract: Relational Deep Learning (RDL) has become a standard methodology for machine learning on relational databases: the database is encoded as a heterogeneous temporal graph in which tuples become nodes and primary-key to foreign-key (PK-FK) dependencies become typed edges, over which a graph neural network is trained for downstream prediction.

By Alan Gany, Bogdan Cautis, Silviu Maniu
Hugging Face Trending Papers
Jul 8

Structural Adversarial Attacks on Relational Deep Learning under Integrity Constraints

Relational Deep Learning (RDL) has become a standard methodology for machine learning on relational databases: the database is encoded as a heterogeneous temporal graph in which tuples become nodes and primary-key to foreign-key (PK-FK) dependencies become typed edges, over which a graph neural network is trained for downstream prediction. We study the adversarial robustness of this pipeline.

arXiv AI
1d ago

Harnessing Trust in Directed Graphs: Redefining Robustness of Graph Learning

The paper reexamines robustness in Graph Neural Networks (GNNs) by focusing on directed graphs, which have been largely ignored in prior work. It introduces a more realistic attack setting for directed graphs and proposes a simple message‑passing defense that can be added as a plug‑in layer. The authors demonstrate that leveraging the trust signals inherent in link directions can significantly enhance GNN robustness, achieving state‑of‑the‑art performance while maintaining strong clean accuracy against both transfer and adaptive attacks.

By Zhichao Hou, Xitong Zhang, Wei Wang, Charu C. Aggarwal, Xiaorui Liu