Papers › D-VAE: A Variational Autoencoder for Directed Acyclic Graphs

D-VAE: A Variational Autoencoder for Directed Acyclic Graphs

24 Apr 2019NeurIPS 2019 12arXiv:1904.11088archive 2025-07-28

Muhan Zhang, Shali Jiang, Zhicheng Cui, Roman Garnett, Yixin Chen

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.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 1 repository linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 8 samples from 1 repository, 5 ran (3 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

muhanzhang/D-VAE officialmentioned in papermentioned on GitHubpytorchMITSyntology: 8 samples, 5 ran (2 instrument-failed) · 3 unverified report
muhanzhang/DVAE officialmentioned in papermentioned on GitHubpytorchMITSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran; the contract check could not run
3ran
3unverified

Licence: 1 of the 8 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from muhanzhang/D-VAE. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

muhanzhang/D-VAE official repository 8 samples, 5 ran (2 instrument-failed) · 3 unverified
compute_kernel_numpy bayesian_optimization/gauss.py ran MIT (permissive) · 6c74edc2c0dc695e · report fixture: signature lls:ndarray/1/float, lsf:ndarray/0/float, x:ndarray/2/float, z:ndarray/2/float · returned ndarray · level recorded 2026-09-25
load_object in 11 papers util.py ran MIT (permissive) · efe304eb2d1e874e · report fixture: signature filename:str/0/str · returned dict · level recorded 2026-09-25
lstm in 6 papers software/enas/src/common_ops.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive) · 266925fcd482144b · report fixture: signature x:EagerTensor/2/float, prev_c:EagerTensor/2/float, prev_h:EagerTensor/2/float, w:EagerTensor/2/float · returned tuple · level recorded 2026-09-22
one_hot in 150 papers
census: 18 implementations from 25 papers, 10 distinct outputs across 6 buckets, one shared input per bucket
util.py ran fingerprinted MIT (permissive) · 7aa8d3508c19b8f6 · report fixture: signature idx:int/0/int, length:int/0/int · returned Tensor · level recorded 2026-09-25
stack_lstm software/enas/src/common_ops.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant MIT (permissive) · 19717b48f9cb0a9a · report fixture: signature x:EagerTensor/2/float, prev_c:list/1/EagerTensor, prev_h:list/1/EagerTensor, w:list/1/EagerTensor · returned tuple · level recorded 2026-09-22
create_weight software/enas/src/common_ops.py unverified MIT (permissive) here; the stored copy is pointer only · f2a563259f2890ae · report
get_highest_over_time bayesian_optimization/summarize.py unverified MIT (permissive) · b877cbe6c942ca45 · report
load_ENAS_graphs util.py unverified MIT (permissive) · 41d695892acdddd6 · report

Tasks

BIG-bench Machine LearningBayesian OptimizationNeural Architecture Search

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

LSTMSigmoid ActivationSoftmaxTanh Activation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections