Graphite: Iterative Generative Modeling of Graphs

28 Mar 2018  ·  Aditya Grover, Aaron Zweig, Stefano Ermon ·

Graphs are a fundamental abstraction for modeling relational data. However, graphs are discrete and combinatorial in nature, and learning representations suitable for machine learning tasks poses statistical and computational challenges. In this work, we propose Graphite, an algorithmic framework for unsupervised learning of representations over nodes in large graphs using deep latent variable generative models. Our model parameterizes variational autoencoders (VAE) with graph neural networks, and uses a novel iterative graph refinement strategy inspired by low-rank approximations for decoding. On a wide variety of synthetic and benchmark datasets, Graphite outperforms competing approaches for the tasks of density estimation, link prediction, and node classification. Finally, we derive a theoretical connection between message passing in graph neural networks and mean-field variational inference.

PDF Abstract

Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Link Prediction Citeseer sGraphite-VAE AUC 94.1% # 8
AP 95.4% # 6
Node Classification Citeseer Graphite Accuracy 71.0 ± 0.07 # 58
Node Classification Cora Graphite Accuracy 82.1% ± 0.06% # 56
Node Classification Pubmed Graphite Accuracy 79.3 ± 0.03 # 48

Methods


No methods listed for this paper. Add relevant methods here