GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders

February 09, 2018 ยท Declared Dead ยท ๐Ÿ› International Conference on Artificial Neural Networks

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Martin Simonovsky, Nikos Komodakis arXiv ID 1802.03480 Category cs.LG: Machine Learning Cross-listed cs.CV, cs.NE Citations 953 Venue International Conference on Artificial Neural Networks Last Checked 2 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted