Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders

About

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.

Martin Simonovsky, Nikos Komodakis• 2018

Related benchmarks

TaskDatasetResultRank
Molecular GenerationQM9
Validity81
30
Abstract graph generationCommunity small
Degree0.35
17
Molecular GenerationQM9 (test)
Validity55.7
17
Abstract graph generationEgo small
Average MMD0.1167
17
Molecule Graph GenerationQM9 (test)
Validity55.7
14
Molecular Graph GenerationMOSES
Validity97.7
13
Graph generationEgo-small (test)
Degree0.13
11
Molecular Graph GenerationQM9
Validity45.8
10
Graph generationQMOF
Uniqueness1
8
Graph generationMeshSeg
Uniqueness1
8
Showing 10 of 21 rows

Other info

Follow for update