Graph Neural Processes: Towards Bayesian Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
We introduce Graph Neural Processes (GNP), inspired by the recent work in conditional and latent neural processes. A Graph Neural Process is defined as a Conditional Neural Process that operates on arbitrary graph data. It takes features of sparsely observed context points as input, and outputs a distribution over target points. We demonstrate graph neural processes in edge imputation and discuss benefits and drawbacks of the method for other application areas. One major benefit of GNPs is the ability to quantify uncertainty in deep learning on graph structures. An additional benefit of this method is the ability to extend graph neural networks to inputs of dynamic sized graphs.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2022The Neural Process Family: Survey, Applications and Perspectivescited by 23
- 2024Approximately Equivariant Neural Processescited by 8
- 2021How Neural Processes Improve Graph Link Predictioncited by 6
- 2023Learning Continuous Network Emerging Dynamics from Scarce Observations via Data-Adaptive Stochastic Processescited by 2
- 2025GraphPPD: Posterior Predictive Modelling for Graph-Level Inferencecited by 0
- 2025GraphPPD: Posterior Predictive Modelling for Graph-Level Inference23 Aug 2025
- 2024Approximately Equivariant Neural Processes19 Jun 2024
- 2023Learning Continuous Network Emerging Dynamics from Scarce Observations via Data-Adaptive Stochastic Processes25 Oct 2023
- 2022The Neural Process Family: Survey, Applications and Perspectives1 Sep 2022
- 2021How Neural Processes Improve Graph Link Prediction30 Sep 2021