Papers › Markov Equivalence and Consistency in Differentiable Structure Learning

Markov Equivalence and Consistency in Differentiable Structure Learning

8 Oct 2024arXiv:2410.06163archive 2025-07-28

Chang Deng, Kevin Bello, Pradeep Ravikumar, Bryon Aragam

Existing approaches to differentiable structure learning of directed acyclic graphs (DAGs) rely on strong identifiability assumptions in order to guarantee that global minimizers of the acyclicity-constrained optimization problem identifies the true DAG. Moreover, it has been observed empirically that the optimizer may exploit undesirable artifacts in the loss function. We explain and remedy these issues by studying the behavior of differentiable acyclicity-constrained programs under general likelihoods with multiple global minimizers. By carefully regularizing the likelihood, it is possible to identify the sparsest model in the Markov equivalence class, even in the absence of an identifiable parametrization. We first study the Gaussian case in detail, showing how proper regularization of the likelihood defines a score that identifies the sparsest model. Assuming faithfulness, it also recovers the Markov equivalence class. These results are then generalized to general models and likelihoods, where the same claims hold. These theoretical results are validated empirically, showing how this can be done using standard gradient-based optimizers, thus paving the way for differentiable structure learning under general models and losses.

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

By repository: found in paper text by Syntology: 7 samples from 2 repositories, 4 ran (1 with no instrument failure; 3 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.

No sample is linked to this paper from 2 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 3 of the 4 samples that ran have no recorded date.

xunzheng/notears found in paper text by SyntologySyntology: 2 samples, 1 ran (1 instrument-failed) · 1 unverified report
Scriddie/Varsortability found in paper text by SyntologyMITSyntology: 5 samples, 3 ran (2 instrument-failed) · 2 unverified report
kevinsbello/dagma found in paper text by SyntologySyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterization (arXiv:2209.08037; that paper's own run record: 6 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified) and TriOpt: A Scalable Algorithm for Linear Causal Discovery (arXiv:2605.17465; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
ignavierng/golem found in paper text by SyntologySyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to On the Role of Sparsity and DAG Constraints for Learning Linear DAGs (arXiv:2006.10201; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
cmu-phil/py-tetrad found in paper text by SyntologyMITSyntology: 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

7 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 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.

3ran · our draft was wrong
1ran
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; the list below is grouped by repository, each group headed by its name and what it is to the paper. 1 sample whose link to this paper records no repository is listed under one of this paper's own repositories, because identical code was harvested from it for another paper. “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.

xunzheng/notears found in paper text by Syntology 2 samples, 1 ran (1 instrument-failed) · 1 unverified
squared_loss in 12 papers notears/nonlinear.py ran · our draft was wrong fingerprinted Apache-2.0 (permissive) · c60cc034e8957e26 · report fixture: signature output:Tensor/2/float, target:Tensor/2/float · returned Tensor · level recorded, date not recorded
notears_linear in 9 papers notears/linear.py identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own unverified licence of this copy not recorded · 8121d0e3bc3faff7 · report
Scriddie/Varsortability found in paper text by Syntology 5 samples, 3 ran (2 instrument-failed) · 2 unverified
coefficient_based_order src/chain_orientation.py ran · our draft was wrong fingerprinted MIT (permissive) · c2ba12495ea1e34a · report fixture: signature Xin:ndarray/2/float, coinflipifundecided:bool/0/bool · returned str · level recorded, date not recorded
regcoeffs src/chain_orientation_three_vars_symbolic.py ran MIT (permissive) · ee404575ddaf526d · report fixture: signature x:RandomSymbol/0/?, y:RandomSymbol/0/?, z:RandomSymbol/0/? · returned tuple · level recorded 2026-09-24
variance_based_order src/chain_orientation.py ran · our draft was wrong fingerprinted MIT (permissive) · 7976785b32d28df1 · report fixture: signature X:ndarray/2/float, coinflipifundecided:bool/0/bool · returned str · level recorded, date not recorded
sortnregress src/sortnregress.py unverified MIT (permissive) · ac90314a0b2a1492 · report
varsortability src/varsortability.py unverified MIT (permissive) · 82949ad32ef09d09 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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