Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fred Xu

dblp:383/7910 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Graph learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.912025
Uncertainty Estimation on Graphs with Structure Informed Stochastic Partial Differential Equations · NeurIPS 2025
Machine learning › Graph learning
graph neural network
0.912025
Uncertainty Estimation on Graphs with Structure Informed Stochastic Partial Differential Equations · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › dynamical system
stochastic partial differential equation
0.912025
Uncertainty Estimation on Graphs with Structure Informed Stochastic Partial Differential Equations · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

message passing · 0.9matérn gaussian process · 0.9SPDE · 0.9
YearPublicationVenuePosition
2025 Uncertainty Estimation on Graphs with Structure Informed Stochastic Partial Differential Equations
abstract
Graph Neural Networks (GNNs) have achieved impressive results across diverse network modeling tasks, but accurately estimating uncertainty on graphs remains difficult—especially under distributional shifts. Unlike traditional uncertainty estimation, graph-based uncertainty must account for randomness arising from both the graph’s structure and its label distribution, which adds complexity. In this paper, making an analogy between the evolution of a stochastic partial differential equation (SPDE) driven by Mat\'ern Gaussian Process and message passing using GNN layers, we present a principled way to design a novel message passing scheme that incorporates spatial-temporal noises motivated by the Gaussian Process approach to SPDE. Our method simultaneously captures uncertainty across space and time and allows explicit control over the covariance kernel’s smoothness, thereby enhancing uncertainty estimates on graphs with both low and high label informativeness. Our extensive experiments on Out-of-Distribution (OOD) detection on graph datasets with varying label informativeness demonstrate the soundness and superiority of our model to existing approaches.
Fred Xu, Thomas Markovich
NeurIPS1