The paper introduces a statistical framework to test whether epistemic uncertainty in node classification decreases as more information about the data‑generating process becomes available. It shows that existing graph evidential deep learning methods fail to meet a consistency criterion under this framework, because they regulate uncertainty via hyperparameters rather than data uncertainty. The authors propose graph bootstrap ensembles, which reduce epistemic uncertainty more effectively than standard deep ensembles and satisfy the consistency criterion in controlled experiments.
By Emma Meneghini, Francesco Ferrini, Bruno Lepri, Andrea Passerini, Veronica Lachi
arXiv:2605. 26477v2 Announce Type: replace Abstract: While Deep Neural Networks (DNNs) achieve remarkable performance, their tendency to produce overconfident predictions.
By Jiawei Tang, Xinyan Du, Hui Liu, Junhui Hou, Yuheng Jia
arXiv:2608. 19914v1 Announce Type: new Abstract: Network topology inference from graph signals is central to graph signal processing with applications in neuroscience, sensor, and social networks.
By Chuansen Peng, Yifan Xia, Jinshan Zhong, Xiaojing Shen
arXiv:2505.11335v5 Announce Type: replace
Abstract: Graph Neural Networks (GNNs) have demonstrated remarkable effectiveness on graph-based tasks. However, their predictive confidence is often miscali...
By Jincheng Huang, Jie Xu, Xiaoshuang Shi, Ping Hu, Lei Feng, Xiaofeng Zhu
arXiv:2609.06154v1 Announce Type: new
Abstract: One-shot federated graph learning generally aims to train Graph Neural Networks (GNNs) across clients with disconnected subgraphs in a single communica...
By Shutong Zheng, Sijia Chen
The paper introduces Latent-Posterior Alignment (LPA), a phenomenon where predictive uncertainty in Graph Neural Networks with Bayesian output layers decreases as latent representations align with lower‑variance posterior directions, even without posterior variance contraction. Through interventional experiments, the authors demonstrate LPA’s functional role in shaping uncertainty and propose Alignment‑Guided Learning (AGL) to explicitly promote this alignment during training. AGL reduces predictive uncertainty, preserves accuracy, and improves structural calibration, ensuring model confidence reflects data density.
By Suk Hoon Choi, Damdae Park, Junhyuk Choi, Hyein Jung, Changsoo Kim, Ung Lee, Kyeongsu Kim
arXiv:2607. 28248v1 Announce Type: cross Abstract: The deployment of deep neural networks in safety-critical domains demands reliable estimates of predictive confidence, yet conventional architectures lack principled uncertainty quantification.
By H. Martin Gillis, Thomas Trappenberg
The paper reviews uncertainty quantification (UQ) methods for graph neural networks used in connectome-based diagnostic classification and presents a case study on a temporal Graph Attention Network applied to dynamic functional connectivity data for Cocaine Use Disorder. It highlights that deterministic GNNs can produce overconfident predictions, as shown by a Monte Carlo dropout audit revealing high confidence on misclassified subjects. The study demonstrates the need for rigorous UQ, calibration, and selective prediction to ensure reliable graph-based biomarkers in clinical neuroscience.
By Mansooreh Pakravan
arXiv:2602. 08142v2 Announce Type: replace Abstract: Machine learning applications require fast and reliable per-sample uncertainty estimation.
By H. Martin Gillis, Isaac Xu, Thomas Trappenberg
arXiv:2608. 07630v1 Announce Type: new Abstract: We adapt two classical statistical estimators for quantifying uncertainty to modern deep learning, in order to provide clearer insights into uncertainty attributable to two sources : aleatoric uncertainty, or locally scarce data.
By Pierre Nodet, Thomas George
The paper introduces MS‑WDRO, a multi‑source Wasserstein distributionally robust optimization framework for reconstructing complex network topologies from scarce target‑domain data and abundant heterogeneous source data. It fuses sources via a weighted Wasserstein barycenter, builds an ambiguity set around it, and solves a regularized Laplacian estimator using a provably convergent ADMM scheme. The authors provide finite‑sample guarantees, demonstrate that naive aggregation is suboptimal, and show through experiments on synthetic data and the ABIDE I neuroimaging dataset that MS‑WDRO outperforms seven baselines in graph recovery, sample efficiency, and diagnostic utility, especially when target samples are limited.
By Chuansen Peng, Yifan Xia, Jinshan Zhong, Xiaojing Shen
arXiv:2608. 15084v1 Announce Type: cross Abstract: Test-time augmentation (TTA) has proven effective for improving model robustness and uncertainty estimation in computer vision, yet its application to graph-structured data remains largely unexplored.
By Zsombor B\'anfi, Andr\'as G\'ezsi, Andr\'as Formanek