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
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Graph generation | ENZYMES | Clustering0.629 | 45 | |
| Molecular Generation | QM9 | Validity81 | 40 | |
| Molecular Graph Generation | QM9 | Validity45.8 | 37 | |
| Molecular Generation | QM9 (test) | Validity55.7 | 32 | |
| Abstract graph generation | Ego small | Average MMD0.1167 | 27 | |
| Graph generation | Community small | MMD (Degree)0.35 | 26 | |
| Graph generation | GRID | Degree Similarity1.619 | 19 | |
| Abstract graph generation | Community small | Degree0.35 | 17 | |
| Molecule Graph Generation | QM9 (test) | Validity55.7 | 14 | |
| Molecular Graph Generation | MOSES | Validity97.7 | 13 |
Showing 10 of 24 rows