Random-Set Graph Neural Networks

• URL: http://arxiv.org/abs/2605.11987v1
• Date: Tue, 12 May 2026 11:38:13 GMT
• Title: Random-Set Graph Neural Networks
• Abstract summary: Uncertainty quantification has become an important factor in understanding the data representations produced by Graph Neural Networks (GNNs)<n>We propose an original new framework in which node-level uncertainty is modelled in a belief function (finite random set) formalism.<n>The resulting Random-Set Graph Neural Networks have a belief-function head predicting a random set over the list of classes, from which both a precise probability prediction and a measure of uncertainty can be obtained.
• Score: 21.342463878021146
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Uncertainty quantification has become an important factor in understanding the data representations produced by Graph Neural Networks (GNNs). Despite their predictive capabilities being ever useful across industrial workspaces, the inherent uncertainty induced by the nature of the data is a huge mitigating factor to GNN performance. While aleatoric uncertainty is the result of noisy and incomplete stochastic data such as missing edges or over-smoothing, epistemic uncertainty arises from lack of knowledge about a system or model (e.g., a graph's topology or node feature representation), which can be reduced by gathering more data and information. In this paper, we propose an original new framework in which node-level epistemic uncertainty is modelled in a belief function (finite random set) formalism. The resulting Random-Set Graph Neural Networks have a belief-function head predicting a random set over the list of classes, from which both a precise probability prediction and a measure of epistemic uncertainty can be obtained. Extensive experiments on 9 different graph learning datasets, including real-world autonomous driving benchmarks as such Nuscene and ROAD, demonstrate RS-GNN's superior uncertainty quantification capabilities

Related papers

• Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach [55.43914153271912]
  Graph neural networks (GNNs) excel in graph representation learning by integrating graph structure and node features.<n>Existing GNNs fail to account for the uncertainty of class probabilities that vary with the depth of the model, leading to unreliable and risky predictions in real-world scenarios.<n>We propose a novel Evidence Fusing Graph Neural Network (EFGNN for short) to achieve trustworthy prediction, enhance node classification accuracy, and make explicit the risk of wrong predictions.
  arXiv  Detail & Related papers  (2025-06-16T03:59:38Z)
• BetaExplainer: A Probabilistic Method to Explain Graph Neural Networks [1.798554018133928]
  Graph neural networks (GNNs) are powerful tools for conducting inference on graph data.<n>Many interpretable GNN methods exist, but they cannot quantify uncertainty in edge weights.<n>We proposed BetaExplainer which addresses these issues by using a sparsity-inducing prior to mask unimportant edges.
  arXiv  Detail & Related papers  (2024-12-16T16:45:26Z)
• Uncertainty in Graph Neural Networks: A Survey [47.785948021510535]
  Graph Neural Networks (GNNs) have been extensively used in various real-world applications.<n>However, the predictive uncertainty of GNNs stemming from diverse sources can lead to unstable and erroneous predictions.<n>This survey aims to provide a comprehensive overview of the GNNs from the perspective of uncertainty.
  arXiv  Detail & Related papers  (2024-03-11T21:54:52Z)
• Uncertainty Propagation in Node Classification [9.03984964980373]
  We focus on measuring uncertainty of graph neural networks (GNNs) for the task of node classification. We propose a Bayesian uncertainty propagation (BUP) method, which embeds GNNs in a Bayesian modeling framework. We present an uncertainty oriented loss for node classification that allows the GNNs to clearly integrate predictive uncertainty in learning procedure.
  arXiv  Detail & Related papers  (2023-04-03T12:18:23Z)
• USER: Unsupervised Structural Entropy-based Robust Graph Neural Network [22.322867182077182]
  Unsupervised graph neural networks (GNNs) are vulnerable to inherent randomness in the input graph data. We propose USER, an unsupervised robust version of graph neural networks that is based on structural entropy. Experiments conducted on clustering and link prediction tasks under random-noises and meta-attack over three datasets show USER outperforms benchmarks.
  arXiv  Detail & Related papers  (2023-02-12T10:32:12Z)
• On the Prediction Instability of Graph Neural Networks [2.3605348648054463]
  Instability of trained models can affect reliability, reliability, and trust in machine learning systems. We systematically assess the prediction instability of node classification with state-of-the-art Graph Neural Networks (GNNs) We find that up to one third of the incorrectly classified nodes differ across algorithm runs.
  arXiv  Detail & Related papers  (2022-05-20T10:32:59Z)
• A General Framework for quantifying Aleatoric and Epistemic uncertainty in Graph Neural Networks [0.29494468099506893]
  Graph Neural Networks (GNN) provide a powerful framework that elegantly integrates Graph theory with Machine learning. We consider the problem of quantifying the uncertainty in predictions of GNN stemming from modeling errors and measurement uncertainty. We propose a unified approach to treat both sources of uncertainty in a Bayesian framework.
  arXiv  Detail & Related papers  (2022-05-20T05:25:40Z)
• NUQ: Nonparametric Uncertainty Quantification for Deterministic Neural Networks [151.03112356092575]
  We show the principled way to measure the uncertainty of predictions for a classifier based on Nadaraya-Watson's nonparametric estimate of the conditional label distribution. We demonstrate the strong performance of the method in uncertainty estimation tasks on a variety of real-world image datasets.
  arXiv  Detail & Related papers  (2022-02-07T12:30:45Z)
• Distributionally Robust Semi-Supervised Learning Over Graphs [68.29280230284712]
  Semi-supervised learning (SSL) over graph-structured data emerges in many network science applications. To efficiently manage learning over graphs, variants of graph neural networks (GNNs) have been developed recently. Despite their success in practice, most of existing methods are unable to handle graphs with uncertain nodal attributes. Challenges also arise due to distributional uncertainties associated with data acquired by noisy measurements. A distributionally robust learning framework is developed, where the objective is to train models that exhibit quantifiable robustness against perturbations.
  arXiv  Detail & Related papers  (2021-10-20T14:23:54Z)
• The Causal Neural Connection: Expressiveness, Learnability, and Inference [125.57815987218756]
  An object called structural causal model (SCM) represents a collection of mechanisms and sources of random variation of the system under investigation. In this paper, we show that the causal hierarchy theorem (Thm. 1, Bareinboim et al., 2020) still holds for neural models. We introduce a special type of SCM called a neural causal model (NCM), and formalize a new type of inductive bias to encode structural constraints necessary for performing causal inferences.
  arXiv  Detail & Related papers  (2021-07-02T01:55:18Z)
• Improving Uncertainty Calibration via Prior Augmented Data [56.88185136509654]
  Neural networks have proven successful at learning from complex data distributions by acting as universal function approximators. They are often overconfident in their predictions, which leads to inaccurate and miscalibrated probabilistic predictions. We propose a solution by seeking out regions of feature space where the model is unjustifiably overconfident, and conditionally raising the entropy of those predictions towards that of the prior distribution of the labels.
  arXiv  Detail & Related papers  (2021-02-22T07:02:37Z)
• Stochastic Graph Neural Networks [123.39024384275054]
  Graph neural networks (GNNs) model nonlinear representations in graph data with applications in distributed agent coordination, control, and planning. Current GNN architectures assume ideal scenarios and ignore link fluctuations that occur due to environment, human factors, or external attacks. In these situations, the GNN fails to address its distributed task if the topological randomness is not considered accordingly.
  arXiv  Detail & Related papers  (2020-06-04T08:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.