Sep 2026· Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence· 0 citations· 35 references
TL;DR
G EO XGNN (Local Geometry Improves Explanation Robustness for Graph Neural Networks), a robust explanation framework that explicitly models the directional sensitivity of structural perturbations from a geometric perspective that significantly improves explanation robustness over existing methods.
Abstract
Graph Neural Networks (GNNs) are widely used in high-stakes decision-making, where explanation robustness is crucial. Yet, even minor structural perturbations can drastically change explanations without changing predictions. Existing methods primarily characterize structural perturbations by their edit distance or budget, and enforce robustness through uniform constraints or averaging mechanisms over this perturbation set, which fail to capture the inherently direction-dependent effects of structural changes.
In this paper, we propose GeoXGNN (Local Geometry Improves Explanation Robustness for Graph Neural Networks), a robust explanation framework that explicitly models the directional sensitivity of structural perturbations from a geometric perspective. GeoXGNN introduces local, direction-aware metrics in the node representation space to characterize how perturbations along different directions affect node embeddings and explanation outcomes. Based on the learned local metrics, GeoXGNN further enforces directional constraints, encouraging explanations to remain robust along high-sensitivity directions while preserving explanatory fidelity.
Extensive experiments on multiple node-level and graph-level benchmark datasets demonstrate that GeoXGNN significantly improves explanation robustness over existing methods.
Results support a conditional empirical conclusion: combining structure, topology, and stability-oriented training can improve robustness under specified structural perturbations, with dataset-dependent accuracy–stability trade-offs rather than universal guarantees.
Jelena Losic, Charles Fanning· PLOS Complex Systems· 0 citations
This work proposes Aggregation-Aware Representation Learning (AARL) to learn numerically stable and cancellation-resistant representations without sacrificing expressiveness, and formalizes this through the cancellation ratio, proving that it is fundamentally governed by graph topology.
Jiawei Gu, Zi-Yue Qiao· Proceedings of the 32nd ACM...· 0 citations
Noise Corruption is introduced, a Noise Corruption-based explanation framework, which perturbs each message through matched-norm random-direction corruption while preserving the expected squared message norm, and NICE, a Noise Corruption-based explanation framework, which learns a Stochastic Restoration Boundary under...
Ziluowen Luo, Jun Yin, Ruo-Chen Liu et al.· 0 citations
This work proposes SeeExplainer, a parameter-free explainer to interpret graph neural networks, and introduces a granular-ball graph refinement mechanism that decomposes a graph into several disjoint granular-balls with no fixed size, and utilizes them as nodes to construct a structural graph.
Jian-Cu Chen, Shuyin Xia, Guan Wang et al.· arXiv.org· 0 citations
This work shows that informative embeddings can be derived without complicated model design and gradient-based training, and suggests that informative graph embeddings can arise from carefully chosen topological transformations before any learning operation is applied.
Meng Qin, Jin-Qiang Cui, Hong-Wei Zheng et al.· 0 citations
This work-in-progress paper proposes graph edit paths as a controlled tool for probing how GNN predictions respond to structural and attribute-level edits, and develops heuristics for generating edit paths and evaluates standard GNNs along these paths, quantifying their sensitivity to different types of edits.
Florian Seiffarth· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.