mlsanityData to 7 Oct 2026

Graph Deconvolutional Generation

arXiv 2002.07087 ↗First posted 14 Feb 2020cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

Graph generation is an extremely important task, as graphs are found throughout different areas of science and engineering. In this work, we focus on the modern equivalent of the Erdos-Renyi random graph model: the graph variational autoencoder (GVAE). This model assumes edges and nodes are independent in order to generate entire graphs at a time using a multi-layer perceptron decoder. As a result of these assumptions, GVAE has difficulty matching the training distribution and relies on an expensive graph matching procedure. We improve this class of models by building a message passing neural network into GVAE's encoder and decoder. We demonstrate our model on the specific task of generating small organic molecules

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 4; 2023: 4; 2024: 2; 2025: 2.

16 papers.

Sort: