Skip to content

NICE: Scale-Stable Perturbations for Graph Neural Network Explanations via Noise Corruption

Aug 2026 · 0 citations · 27 references
Computer Science

TL;DR

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 NC-induced uncertainty, balancing target-prediction restoration against compactness.

Abstract

Post-hoc Graph Neural Network (GNN) explainers commonly follow a Perturb-Query paradigm, inferring the importance of graph elements based on queried predictions to perturbed inputs. However, such perturbations often introduce substantial distribution shift, undermining the reliability of the queried predictions used to derive explanations. While existing efforts mainly improve perturbed graphs or stabilize model predictions on them, we revisit the perturbation mechanism itself. We show that the widely used Element-wise Masking(EM) suppresses edge-induced messages toward zero, causing deterministic scale contraction that accumulates across message-passing layers, a phenomenon we term Scale Drift. Consequently, prediction changes under EM may conflate information corruption with deviations in propagation scale. As a scale-stable alternative to EM, we introduce Noise Corruption (NC), which perturbs each message through matched-norm random-direction corruption while preserving the expected squared message norm. Building on NC, we propose NICE, a Noise Corruption-based explanation framework, which learns a Stochastic Restoration Boundary (SRB) under NC-induced uncertainty, balancing target-prediction restoration against compactness. Furthermore, Boundary-Integrated Gradient (BIG) converts this boundary into edge attributions by accumulating each edge's contribution to reducing restoration risk along the restoration path. Experiments across multiple benchmarks demonstrate stronger explanation performance and model faithfulness while confirming that NC substantially reduces the Scale Drift induced by masking.

View source

Similar papers

Preprint Aug 2026

Subgraph Filtering for Fair Graph Neural Networks

Subgraph Filtering for Fair Graph Neural Networks is proposed, a lightweight and architecture-agnostic framework that mitigates structural bias at its source and achieves consistent fairness improvements while maintaining competitive predictive performance, leading to a better fairness--accuracy trade-off than recent f...

Hao-Hui Lu, Ji-Yuan Tian, Fangyu Zhou et al. · 0 citations
Conference Open access Sep 2026

Local Geometry Improves Explanation Robustness for Graph Neural Networks

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.

Mengting Diao, Li Sun, Sen Su · 0 citations
Book Open access Aug 2026

Out-of-Distribution Robust Explainer for Graph Neural Networks

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

Geonhee Han, Heesoo Jung, Hyunju Kang et al. · 0 citations
Aug 2026

Uncertainty-Aware Adaptive Edge Blocking in Heterophilic Graph Neural Networks

This work provides theoretical guarantees for the selective blocking rule by deriving the signed-versus-blocked decision boundary, separating signed-matrix effects from nonnegative block-operator spectral arguments, and showing when adaptive blocking preserves class-dependent components.

Ji-Ho Choi, Yu-Min Lee, Chanran Kim et al. · 0 citations
Book Open access Aug 2026

The Hidden Fragility of GNNs: How Graph Structure Amplifies Numerical Errors

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, Ziyue Qiao · 0 citations
Book Open access Jul 2026

Precision at Scale: An End-to-End Graph-based Framework for Mitigating Network Interference in TikTok A/B Tests

This paper presents a production-ready framework deployed at TikTok, which integrates three core contributions to address the challenges of large-scale A/B tests on social platforms, and reduces interference rates by 68.8%, correcting a biased treatment effect estimate and enables previously undetectable cross-ecosyste...

Yu-Han Li, Jian-Yu Ni, Ao Li et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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