D-VAE: A Variational Autoencoder for Directed Acyclic Graphs
Abstract
Graph structured data are abundant in the real world. Among different graph types, directed acyclic graphs (DAGs) are of particular interest to machine learning researchers, as many machine learning models are realized as computations on DAGs, including neural networks and Bayesian networks. In this paper, we study deep generative models for DAGs, and propose a novel DAG variational autoencoder (D-VAE). To encode DAGs into the latent space, we leverage graph neural networks. We propose an asynchronous message passing scheme that allows encoding the computations on DAGs, rather than using existing simultaneous message passing schemes to encode local graph structures. We demonstrate the effectiveness of our proposed DVAE through two tasks: neural architecture search and Bayesian network structure learning. Experiments show that our model not only generates novel and valid DAGs, but also produces a smooth latent space that facilitates searching for DAGs with better performance through Bayesian optimization.
Cite
Text
Zhang et al. "D-VAE: A Variational Autoencoder for Directed Acyclic Graphs." Neural Information Processing Systems, 2019.Markdown
[Zhang et al. "D-VAE: A Variational Autoencoder for Directed Acyclic Graphs." Neural Information Processing Systems, 2019.](https://mlanthology.org/neurips/2019/zhang2019neurips-dvae/)BibTeX
@inproceedings{zhang2019neurips-dvae,
title = {{D-VAE: A Variational Autoencoder for Directed Acyclic Graphs}},
author = {Zhang, Muhan and Jiang, Shali and Cui, Zhicheng and Garnett, Roman and Chen, Yixin},
booktitle = {Neural Information Processing Systems},
year = {2019},
pages = {1588-1600},
url = {https://mlanthology.org/neurips/2019/zhang2019neurips-dvae/}
}