Credal Graph Neural Networks

• URL: http://arxiv.org/abs/2512.02722v1
• Date: Tue, 02 Dec 2025 12:56:26 GMT
• Title: Credal Graph Neural Networks
• Authors: Matteo Tolloso, Davide Bacciu,
• Abstract summary: Uncertainty quantification is essential for deploying reliable Graph Neural Networks (GNNs)<n>We introduce the first credal graph neural networks (CGNNs), which extend credal learning to the graph domain by training GNNs to output set-valued predictions in the form of credal sets.
• Score: 20.033654556319053
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Uncertainty quantification is essential for deploying reliable Graph Neural Networks (GNNs), where existing approaches primarily rely on Bayesian inference or ensembles. In this paper, we introduce the first credal graph neural networks (CGNNs), which extend credal learning to the graph domain by training GNNs to output set-valued predictions in the form of credal sets. To account for the distinctive nature of message passing in GNNs, we develop a complementary approach to credal learning that leverages different aspects of layer-wise information propagation. We assess our approach on uncertainty quantification in node classification under out-of-distribution conditions. Our analysis highlights the critical role of the graph homophily assumption in shaping the effectiveness of uncertainty estimates. Extensive experiments demonstrate that CGNNs deliver more reliable representations of epistemic uncertainty and achieve state-of-the-art performance under distributional shift on heterophilic graphs.

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)
• Hierarchical Uncertainty-Aware Graph Neural Network [3.4498722449655066]
  This work introduces a novel architecture, the Hierarchical Uncertainty-Aware Graph Neural Network (HU-GNN)<n>It unifies multi-scale representation learning, principled uncertainty estimation, and self-supervised embedding diversity within a single end-to-end framework.<n>Specifically, HU-GNN adaptively forms node clusters and estimates uncertainty at multiple structural scales from individual nodes to higher levels.
  arXiv  Detail & Related papers  (2025-04-28T14:22:18Z)
• Conditional Uncertainty Quantification for Tensorized Topological Neural Networks [19.560300212956747]
  Graph Neural Networks (GNNs) have become the de facto standard for analyzing graph-structured data. Recent studies have raised concerns about the statistical reliability of uncertainty estimates produced by GNNs. This paper introduces a novel technique for quantifying uncertainty in non-exchangeable graph-structured data.
  arXiv  Detail & Related papers  (2024-10-20T01:03:40Z)
• xAI-Drop: Don't Use What You Cannot Explain [23.33477769275026]
  Graph Neural Networks (GNNs) have emerged as the predominant paradigm for learning from graph-structured data. GNNs face challenges such as lack of generalization and poor interpretability. We introduce xAI-Drop, a novel topological-level dropping regularizer.
  arXiv  Detail & Related papers  (2024-07-29T14:53:45Z)
• Kolmogorov-Arnold Graph Neural Networks [2.4005219869876453]
  Graph neural networks (GNNs) excel in learning from network-like data but often lack interpretability.<n>We propose the Graph Kolmogorov-Arnold Network (GKAN) to enhance both accuracy and interpretability.
  arXiv  Detail & Related papers  (2024-06-26T13:54:59Z)
• 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)
• Revealing Decurve Flows for Generalized Graph Propagation [108.80758541147418]
  This study addresses the limitations of the traditional analysis of message-passing, central to graph learning, by defining em textbfgeneralized propagation with directed and weighted graphs. We include a preliminary exploration of learned propagation patterns in datasets, a first in the field.
  arXiv  Detail & Related papers  (2024-02-13T14:13:17Z)
• Accurate and Scalable Estimation of Epistemic Uncertainty for Graph Neural Networks [38.17680286557666]
  We propose a novel training framework designed to improve intrinsic GNN uncertainty estimates.<n>Our framework adapts the principle of centering data to graph data through novel graph anchoring strategies.<n>Our work provides insights into uncertainty estimation for GNNs, and demonstrates the utility of G-$Delta$UQ in obtaining reliable estimates.
  arXiv  Detail & Related papers  (2024-01-07T00:58:33Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• Training Stable Graph Neural Networks Through Constrained Learning [116.03137405192356]
  Graph Neural Networks (GNNs) rely on graph convolutions to learn features from network data. GNNs are stable to different types of perturbations of the underlying graph, a property that they inherit from graph filters. We propose a novel constrained learning approach by imposing a constraint on the stability condition of the GNN within a perturbation of choice.
  arXiv  Detail & Related papers  (2021-10-07T15:54:42Z)

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.