D-VAE: A Variational Autoencoder for Directed Acyclic Graphs
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Global optimization of graph acquisition functions for neural architecture search
Interpretable Hybrid-Rule Temporal Point Processes
Improving Neural Architecture Search by Mixing a FireFly algorithm with a Training Free Evaluation
Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
Reinforcement Learning Increases Wind Farm Power Production by Enabling Closed-Loop Collaborative Control
토론
이 논문과 연결된 포럼 글이 아직 없습니다.