Papers › BayesDAG: Gradient-Based Posterior Inference for Causal Discovery

BayesDAG: Gradient-Based Posterior Inference for Causal Discovery

26 Jul 2023NeurIPS 2023 11arXiv:2307.13917archive 2025-07-28

Yashas Annadani, Nick Pawlowski, Joel Jennings, Stefan Bauer, Cheng Zhang, Wenbo Gong

Bayesian causal discovery aims to infer the posterior distribution over causal models from observed data, quantifying epistemic uncertainty and benefiting downstream tasks. However, computational challenges arise due to joint inference over combinatorial space of Directed Acyclic Graphs (DAGs) and nonlinear functions. Despite recent progress towards efficient posterior inference over DAGs, existing methods are either limited to variational inference on node permutation matrices for linear causal models, leading to compromised inference accuracy, or continuous relaxation of adjacency matrices constrained by a DAG regularizer, which cannot ensure resulting graphs are DAGs. In this work, we introduce a scalable Bayesian causal discovery framework based on a combination of stochastic gradient Markov Chain Monte Carlo (SG-MCMC) and Variational Inference (VI) that overcomes these limitations. Our approach directly samples DAGs from the posterior without requiring any DAG regularization, simultaneously draws function parameter samples and is applicable to both linear and nonlinear causal models. To enable our approach, we derive a novel equivalence to the permutation-based DAG learning, which opens up possibilities of using any relaxed gradient estimator defined over permutations. To our knowledge, this is the first framework applying gradient-based MCMC sampling for causal discovery. Empirical evaluation on synthetic and real-world datasets demonstrate our approach's effectiveness compared to state-of-the-art baselines.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2307.13917")

Code

Syntology Ran 4 of 7 code samples harvested from 2 repositories linked to this paper; 3 have no recorded run. Of those that ran: 4 ran with no contract checked.

By repository: official repository: 4 samples from 1 repository, 3 ran; found in paper text by Syntology: 2 samples from 1 repository, 1 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

microsoft/Project-BayesDAG officialmentioned in papermentioned on GitHubjaxMIT 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

7 samples harvested; 4 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

4ran
3unverified

Licence: 1 of the 7 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

download_dataset microsoft/Project-BayesDAG/src/causica/download_dataset.py official repository ran MIT (permissive) · 20a53997e54a0737 · report
split_configs microsoft/Project-BayesDAG/src/causica/run_experiment.py official repository ran MIT (permissive) · f322162c5e45f661 · report
untranspose_stack microsoft/Project-BayesDAG/src/causica/models/bayesdag/generation_functions.py official repository ran MIT (permissive) · 7e67818eba876c55 · report
create_diagonal_spline_flow microsoft/Project-BayesDAG/src/causica/models/bayesdag/diagonal_flows.py official repository unverified MIT (permissive) · c4e4a51a4b478e9e · report
BaseModel kurowasan/GraN-DAG/gran_dag/models/learnables.py found in paper text by Syntology ran · metamorphic tier: deterministic MIT (permissive) · e8d9b4d10fe3230b · report
LearnableModel kurowasan/GraN-DAG/gran_dag/models/learnables.py found in paper text by Syntology unverified MIT (permissive) · a9daf9295e1bea2b · report
compute_A_phi identical code first harvested elsewhere unverified licence of this copy not recorded · 6ed7da204f2567a9 · report

Tasks

Causal DiscoveryVariational Inference

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Variational Inference

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