Graph Neural Processes: Towards Bayesian Graph Neural Networks
arXiv:1902.10042
Abstract
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.
References in corpus (15)
- Adam: A Method for Stochastic Optimization
- Semi-Supervised Classification with Graph Convolutional Networks
- Geometric deep learning: going beyond Euclidean data
- Graph Neural Networks: A Review of Methods and Applications
- Interaction Networks for Learning about Objects, Relations and Physics
- A simple neural network module for relational reasoning
- Dynamic Graph CNN for Learning on Point Clouds
- Graph networks as learnable physics engines for inference and control
- A Compositional Object-Based Approach to Learning Physical Dynamics
- Relational Neural Expectation Maximization: Unsupervised Discovery of Objects and their Interactions
- Traffic Graph Convolutional Recurrent Neural Network: A Deep Learning Framework for Network-Scale Traffic Learning and Forecasting
- Knowledge Transfer for Out-of-Knowledge-Base Entities: A Graph Neural Network Approach
- Discovering objects and their relations from entangled scene representations
- Conditional Neural Processes
- Bayesian graph convolutional neural networks for semi-supervised classification