Papers › Sample Efficient Bayesian Learning of Causal Graphs from Interventions

Sample Efficient Bayesian Learning of Causal Graphs from Interventions

26 Oct 2024arXiv:2410.20089archive 2025-07-28

Zihan Zhou, Muhammad Qasim Elahi, Murat Kocaoglu

Causal discovery is a fundamental problem with applications spanning various areas in science and engineering. It is well understood that solely using observational data, one can only orient the causal graph up to its Markov equivalence class, necessitating interventional data to learn the complete causal graph. Most works in the literature design causal discovery policies with perfect interventions, i.e., they have access to infinite interventional samples. This study considers a Bayesian approach for learning causal graphs with limited interventional samples, mirroring real-world scenarios where such samples are usually costly to obtain. By leveraging the recent result of Wienöbst et al. (2023) on uniform DAG sampling in polynomial time, we can efficiently enumerate all the cut configurations and their corresponding interventional distributions of a target set, and further track their posteriors. Given any number of interventional samples, our proposed algorithm randomly intervenes on a set of target vertices that cut all the edges in the graph and returns a causal graph according to the posterior of each target set. When the number of interventional samples is large enough, we show theoretically that our proposed algorithm will return the true causal graph with high probability. We compare our algorithm against various baseline methods on simulated datasets, demonstrating its superior accuracy measured by the structural Hamming distance between the learned DAG and the ground truth. Additionally, we present a case study showing how this algorithm could be modified to answer more general causal questions without learning the whole graph. As an example, we illustrate that our method can be used to estimate the causal effect of a variable that cannot be intervened.

PaperPDFCodeCode 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 15 code samples harvested from 1 repository linked to this paper: 12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 7 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 15 samples from 1 repository, 12 ran (5 with no instrument failure; 7 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-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 12 samples that ran has no recorded date.

CausalML-Lab/Bayesian_SampleEfficient_Discovery officialSyntology: 15 samples, 12 ran (7 instrument-failed) · 3 unverified 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

15 samples harvested: 12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 7 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 last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

4ran · honoured contract
7ran · our draft was wrong
1ran
3unverified

Licence: 15 of the 15 samples are 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 CausalML-Lab/Bayesian_SampleEfficient_Discovery. “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.

CausalML-Lab/Bayesian_SampleEfficient_Discovery official repository 15 samples, 12 ran (7 instrument-failed) · 3 unverified
atomic_graph_sep graph_structure.py ran · our draft was wrong no licence file found · pointer only · 52836bcd516a4427 · report fixture: signature G:Graph/0/? · returned dict · level recorded 2026-09-26
get_K_1_n examples.py ran · honoured contract no licence file found · pointer only · 443976f59ffba29d · report fixture: signature n_nodes:int/0/int, plot:bool/0/bool · returned DiGraph · level recorded 2026-09-26
get_adj_list baselines/radpt.py ran · our draft was wrong no licence file found · pointer only · eacc0e7403b32a19 · report fixture: signature nx_G:Graph/0/? · returned dict · level recorded 2026-09-22
get_bin_class enumerator.py ran · our draft was wrong no licence file found · pointer only · 2f4883616bcb3216 · report fixture: signature n_V_neighbors:int/0/int, i:int/0/int · returned str · level recorded 2026-09-26
get_clique examples.py ran · honoured contract no licence file found · pointer only · 8fc46e8b45ac5483 · report fixture: returned DiGraph · level recorded 2026-09-26
get_diamond examples.py ran · honoured contract no licence file found · pointer only · 642bad94ae3ed0c3 · report fixture: signature plot:bool/0/bool · returned DiGraph · level recorded 2026-09-26
get_non_adjacent_pair case_study.py ran · our draft was wrong no licence file found · pointer only · fd5af47e07550f0f · report fixture: signature dag:DiGraph/0/? · returned tuple · level recorded 2026-09-26
greedy_coloring graph_structure.py ran · our draft was wrong no licence file found · pointer only · feef95c528657f33 · report fixture: signature G:Graph/0/?, PEO:list/1/int · returned dict · level recorded 2026-09-26
perfect_elimination_ordering baselines/radpt.py ran · our draft was wrong no licence file found · pointer only · 9a18f5773d40847c · report fixture: signature graph:dict/0/? · returned list · level recorded 2026-09-26
read_DAG Utils.py ran no licence file found · pointer only · 0fc2070338005128 · report fixture: signature jl_id_to_nx_id_map:dict/0/?, graph_dir:str/0/str · returned DiGraph · level recorded 2026-09-26
shanmugam_random_chordal baselines/run_baseline.py ran · honoured contract no licence file found · pointer only · bcabc09d303bbe8d · report fixture: signature nnodes:int/0/int, density:float/0/float · returned DiGraph · level recorded, date not recorded
write_graph Utils.py ran · our draft was wrong no licence file found · pointer only · e873f40110871fc5 · report fixture: signature G:Graph/0/?, graph_dir:str/0/str · returned dict · level recorded 2026-09-26
Learn_cut baselines/rnd.py unverified no licence file found · pointer only · 8c3b36b8dba8ea49 · report
Sample_and_update_dist baselines/rnd.py unverified no licence file found · pointer only · 120e6e503802b072 · report
is_chordal baselines/radpt.py unverified no licence file found · pointer only · 1b8ef5145560c1e4 · report

Tasks

Causal Discovery

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

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