Skip to content

Uncertainty-Aware Adaptive Edge Blocking in Heterophilic Graph Neural Networks

Aug 2026 · ACM Transactions on Intelligent Systems and Technology · 0 citations · 44 references

TL;DR

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.

Abstract

Graph Neural Networks (GNNs) deliver strong performance through message passing (MP), yet they can become fragile when graphs contain many heterophilic links or when edge types are predicted incorrectly. Earlier analyses suggest that signed message propagation can reduce over-smoothing when the edge misclassification rate is low. However, many such analyses condition on accurately identified edge types and blur the distinction between neighbor propagation and self-retention. This work re-examines these assumptions and shows that under high uncertainty in edge labels, message passing can reduce node distinguishability even when signed edge weights are applied. The central insight is that uncertain edges should not always be propagated: it can be preferable to adaptively block a message when the estimated edge-type error outweighs the expected gain from signed propagation. Concretely, we analyze neighbor propagation without treating self-loops as edge-type observations, use a row-normalized operator for the neighbor process, and estimate two latent reliability factors during training: the local homophily and the edge classification error rate. To avoid leakage between reliability estimation and model selection, the edge error rate is estimated from a separate calibration split or from a train-only proxy, while validation labels are reserved for hyperparameter and checkpoint selection. We provide 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. Experiments on homophilic, heterophilic, and large-scale graphs show that the proposed strategy consistently improves signed GNN backbones and remains competitive with strong heterophily-oriented baselines. Compared with the UAI 2025 conference version [11], this journal version adds an extension analysis, tightened derivations, a leakage-free calibration protocol, and expanded empirical results.

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
Jul 2026

HeAD-CP: Heterophily-Aware Diffused Conformal Prediction Sets for Graph Neural Networks

HeAD-CP is proposed, a family of node-wise diffusion variants whose coefficients are determined by a label-free local-homophily estimate derived from the GNN softmax, which are most effective at extreme heterophily, intermediate heterophily, and moderate-to-high homophily, respectively, and all preserve the marginal co...

P. Lam, Anh Thai Nguyen · 0 citations
#artificial intelligence Preprint Aug 2026

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

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
#graph neural networks Open access Sep 2026

Topology-aware GNNs under structural perturbations: Empirical robustness across domains

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 · 0 citations

An Integration of Fuzzy-Enhanced Heterophilic Graph Representation Learning for Improving Performance of Link Prediction

Extensive experiments ensure that FHGE consistently outperforms state-of-the-art baselines and demonstrate the power of fuzzy-driven learning in improving graph embedding quality and establish FHGE as a promising solution for real-world link prediction tasks.

Linh Nguyen Thi My, Tham Vo · 5 citations

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