Skip to content
Book Open access

Out-of-Distribution Robust Explainer for Graph Neural Networks

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 1518-1529 · 0 citations · 27 references

TL;DR

Experiments on synthetic and real-world datasets show that ORExplainer consistently provides more robust explanations across diverse node-level OOD settings, outperforming existing baselines.

Abstract

Graph Neural Networks (GNNs) have become widely used for analyzing graph-structured data, motivating post-hoc explanation methods for interpreting pre-trained GNNs. However, most existing explainers have primarily been designed and evaluated in settings where the inference graph is structurally or distributionally similar to the graph used to train the GNN. This setting can be fragile in practical deployment, where inference time graphs may contain newly introduced nodes and edges that deviate substantially from the training distribution. Such Out-of-Distribution (OOD) entities can introduce spurious signals during explanation generation, causing explainers to highlight unreliable graph components. Nevertheless, the robustness of post-hoc GNN explainers under OOD-contaminated inference graphs remains largely unexplored. To address this gap, we propose ORExplainer (Out-of-Distribution Robust Explainer), a post-hoc node-level explanation framework for inference graphs containing OOD nodes. ORExplainer quantifies node-level distributional deviation using an energy-based score computed from a pre-trained GNN, and propagates this score to learn explanations that emphasize In-Distribution (ID) nodes while suppressing OOD influence. Experiments on synthetic and real-world datasets show that ORExplainer consistently provides more robust explanations across diverse node-level OOD settings, outperforming existing baselines. Our code is available at https://github.com/gunhee8178/ORExplainer.

Read PDF

Similar papers

Sep 2026

Generalizing on Diverse Shifts: A Unified Topology-Aware Reweighting Algorithm for Graphs.

Topology-Aware Dynamic Reweighting (TAR+), a model-agnostic framework for node classification under strict graph distribution shifts and related robustness stressors, is proposed, supporting the broad applicability of topology-aware reweighting across heterogeneous graph learning conditions.

Jia-Xing Li, Jia-Shuo Liu, Wei-Huang Zheng et al. · 0 citations
Conference Open access Sep 2026

HGOOD: Hypergraph-enhanced Graph Contrastive Learning for Graph Out-of-Distribution Detection

A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...

Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al. · 0 citations
#machine learning Preprint Sep 2026

Message Passing Does More with Less for In-Context Learning on Graphs

Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeated costs and effort. Graph in-context learning (ICL) avoids this by using a single pretrained model to predict unknown node labels directly from labeled context nodes. E...

Dooho Lee, Jin-Mo Lee, Minho Jeong et al. · 0 citations
#machine learning Open access Jan 2025

DeltaGNN: Graph Neural Network With Information Flow Control

DeltaGNN is introduced, to the best of the authors' knowledge, among the first scalable (featuring linear computational and memory complexity overhead) and generalizable (capable of effectively handling graphs with diverse homophily, density, and topology) architectures for long-range and short-range interaction detect...

Kevin Mancini, Islem Rekik · 2 citations
Conference Open access Sep 2026

ADC-GNN: Adaptive Dual-level Collaborative Graph Neural Networks for Graph Classification

This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.

Wan Tang, Lu Bai, Li-Xin Cui et al. · 0 citations
#machine learning Preprint Sep 2026

SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking

This work introduces the Synthetic Community-Aware Attributed Graph Generator (SynCo), a graph generation algorithm that allows users to control the node degree distribution and sub-community structure and outperforms state-of-the-art approaches in synthetic graph generation and data augmentation.

Guilherme Henrique Messias, M. C. de Souza, Sylvia Iasulaitis et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.