arXiv AI

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

arXiv:2606. 01560v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) are vulnerable to adversarial attacks, which inherently invert connectivity patterns by introducing disassortative edges in assortative graphs and assortative edges in disassortative graphs.

Hugging Face Trending Papers
Jun 1

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

Graph Neural Networks (GNNs) are vulnerable to adversarial attacks, which inherently invert connectivity patterns by introducing disassortative edges in assortative graphs and assortative edges in disassortative graphs. This structural inversion creates structure-feature mismatches that disrupt neighborhood aggregation across different graph types.

arXiv AI
Jun 19

Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement

arXiv:2606. 20283v1 Announce Type: cross Abstract: Graph neural networks (GNNs) excel at aggregating neighbor information for classification, yet their performance is hindered by graph structural entanglement, where spurious correlations from semantically irrelevant neighbors contaminate node embeddings.

By Jiaqing Chen, Zidu Yin, Yichao Cai, Yuhang Liu, Zhen Zhang, Dong Gong, Javen Qinfeng Shi
arXiv Machine Learning
Jun 5

PAC-Bayesian Adversarially Robust Generalization for Message Passing Graph Neural Networks: A Sensitivity Analysis

arXiv:2606. 06293v1 Announce Type: new Abstract: Whilst the vulnerability of graph neural networks (GNNs) to adversarial attacks poses a critical threat to graph representation learning, the understanding of the robust generalization behavior remains a fundamental challenge in the adversarial setting.

By Ziling Liang, Xinping Yi, Qingsong Wen, Shi Jin
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 25

Reachability-Based Formal Verification of Graph Neural Networks with Node and Edge Features

The paper extends the neural network verification framework to graph neural networks by introducing GraphStar sets, which model uncertainty over both node and edge features. This allows sound propagation of linear message‑passing operations and ReLU nonlinearities for GCN and GINE layers. Experiments on power system tasks (PF, OPF, CFA) and graph classification benchmarks (ENZYMES, PROTEINS) show that the method, called GNNV, yields tighter robustness guarantees than CORA and provides, for the first time, edge‑aware guarantees for GINE‑based models under joint node and edge perturbations.

By Anne M. Tumlin, Ben Wooding, Zhenxuan Shao, Diego Manzanas Lopez, Tyler Derr, Taylor T. Johnson