UPDF AI

GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders

Martin Simonovsky,N. Komodakis

2018 · DOI: 10.1007/978-3-030-01418-6_41
International Conference on Artificial Neural Networks · 967 Citations

TLDR

This work proposes to sidestep hurdles associated with linearization of discrete structures by having a decoder output a probabilistic fully-connected graph of a predefined maximum size directly at once by formulated as a variational autoencoder.

Abstract

Deep learning on graphs has become a popular research topic with many applications. However, past work has concentrated on learning graph embedding tasks, which is in contrast with advances in generative models for images and text. Is it possible to transfer this progress to the domain of graphs? We propose to sidestep hurdles associated with linearization of such discrete structures by having a decoder output a probabilistic fully-connected graph of a predefined maximum size directly at once. Our method is formulated as a variational autoencoder. We evaluate on the challenging task of molecule generation.