Uncertainty in Graph Neural Networks: A Survey
Fangxin Wang, Yuqing Liu, Kay Liu, Yibo Wang, Sourav Medya, Philip S. Yu
TL;DR
This work addresses predictive uncertainty in $PU = AU + EU$ for Graph Neural Networks and emphasizes the decomposition $EU = MU + DU$ to distinguish model-based epistemic uncertainty from distributional shifts. It proposes a three-stage framework—identify sources, quantify uncertainty, and utilize uncertainty—for systematic study and practical guideposts. By surveying a taxonomy of methods (direct, Bayesian/random-parameter, and other approaches) and detailing evaluation metrics, the paper highlights gaps such as the lack of ground-truth uncertainty and the need for task-aligned evaluation. The authors outline real-world applications and future directions to foster efficient, robust, and trustworthy graph learning across communities and domains.
Abstract
Graph Neural Networks (GNNs) have been extensively used in various real-world applications. However, the predictive uncertainty of GNNs stemming from diverse sources such as inherent randomness in data and model training errors can lead to unstable and erroneous predictions. Therefore, identifying, quantifying, and utilizing uncertainty are essential to enhance the performance of the model for the downstream tasks as well as the reliability of the GNN predictions. This survey aims to provide a comprehensive overview of the GNNs from the perspective of uncertainty with an emphasis on its integration in graph learning. We compare and summarize existing graph uncertainty theory and methods, alongside the corresponding downstream tasks. Thereby, we bridge the gap between theory and practice, meanwhile connecting different GNN communities. Moreover, our work provides valuable insights into promising directions in this field.
