D-VAE: A Variational Autoencoder for Directed Acyclic Graphs

Muhan Zhang, Shali Jiang, Zhicheng Cui, Roman Garnett, Yixin Chen
4/24/2019
cs.LGstat.ML

Official code: muhanzhang/D-VAE (147 stars, MIT, last commit 2020-09-23).

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.

View on arXivView PDF

Code Implementations(1)

muhanzhang/D-VAEOfficial100%
MIT

D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019

14730C, RMay 14, 20196 years agoMIT

Similar Papers

Cite this paper

@article{zhang2019dvae,
  title  = {D-VAE: A Variational Autoencoder for Directed Acyclic Graphs},
  author = {Muhan Zhang and Shali Jiang and Zhicheng Cui and Roman Garnett and Yixin Chen},
  year   = {2019},
  eprint = {1904.11088},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1904.11088}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1904.11088.svg)](https://codeofpaper.com/paper/1904.11088)

Discussion