Pith. sign in

REVIEW 1 cited by

Graph Neural Processes: Towards Bayesian Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.10042 v2 pith:IYI2DZGG submitted 2019-02-26 cs.LG stat.ML

classification cs.LGstat.ML
keywords graphneuralprocessesabilitybenefitconditionalmethodnetworks
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. GraphPPD: Posterior Predictive Modelling for Graph-Level Inference

    stat.ML 2025-08 conditional novelty 4.0 of 10

    A cross-attention context layer on top of graph neural networks yields small accuracy gains and uncertainty estimates for graph-level classification and regression.

Pith tools