mlsanityData to 14 Oct 2026

Beyond Soft Masks: Hard-Perturbation Mixup Explainer for Robust GNN Explainability

arXiv 2606.05756 ↗First posted 4 Jun 2026cs.LG cs.AI cs.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have demonstrated remarkable performance across a range of applications involving graph-structured data, particularly in high-stakes domains. However, the opaque nature of their decision-making processes limits their trustworthiness and broader adoption. Existing post-hoc explanation methods aim to improve explainability by identifying subgraphs that influence GNN predictions and adopt mixup strategies to alleviate the out-of-distribution (OOD) issue caused by using subgraphs for prediction. Yet, these approaches typically rely on soft masks, which are inherently unable to fully eliminate label-irrelevant information, allowing redundant structures to leak into the mixup process and hindering the resolution of the OOD problem, thereby degrading explanation fidelity. In this work, we propose HPME, a Hard-Perturbation Mixup Explanation framework grounded in a generalized Graph Information Bottleneck, which leverages graph pooling to extract discrete explanatory subgraphs and to yield an information-capacity bound to thoroughly compress label-irrelevant components. Furthermore, we introduce a novel mixup strategy built upon structure-level replacement, generating in-distribution explanations to effectively mitigate the distribution shift. Extensive experiments on diverse tasks demonstrate that HPME achieves state-of-the-art performance in generating robust and interpretable explanations across both synthetic and real-world datasets.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 4 Jun 2026.

Builds on

27 of 48 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Graph Attention Networkscited by 8,923
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  4. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  5. 2018Link Prediction Based on Graph Neural Networkscited by 832
  6. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  7. 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 737
  8. 2019Graph U-Netscited by 492
  9. 2020Parameterized Explainer for Graph Neural Networkcited by 426
  10. 2019Self-Attention Graph Poolingcited by 421
  11. 2021GemNet: Universal Directional Graph Neural Networks for Moleculescited by 343
  12. 2021On Explainability of Graph Neural Networks via Subgraph Explorationscited by 281
15 more
  1. 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 250
  2. 2020Can Graph Neural Networks Count Substructures?cited by 236
  3. 2020XGNN: Towards Model-Level Explanations of Graph Neural Networkscited by 211
  4. 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
  5. 2020Graph Information Bottleneckcited by 168
  6. 2019Learning the Graphical Structure of Electronic Health Records with Graph Convolutional Transformercited by 88
  7. 2022GStarX: Explaining Graph Neural Networks with Structure-Aware Cooperative Gamescited by 42
  8. 2020Contrastive Graph Neural Network Explanationcited by 20
  9. 2023MixupExplainer: Generalizing Explanations for Graph Neural Networks with Data Augmentationcited by 18
  10. 2022Modeling Network-level Traffic Flow Transitions on Sparse Datacited by 12
  11. 2024Explaining Graph Neural Networks via Structure-aware Interaction Indexcited by 11
  12. 2023GInX-Eval: Towards In-Distribution Evaluation of Graph Neural Network Explanationscited by 9
  13. 2023Rethinking Explaining Graph Neural Networks via Non-parametric Subgraph Matchingcited by 8
  14. 2024MAGE: Model-Level Graph Neural Networks Explanations via Motif-based Graph Generationcited by 7
  15. 2025RISE: Radius of Influence based Subgraph Extraction for 3D Molecular Graph Explanationcited by 3

Built on by

Not cited yet.