AI Paper Atlas

Research map / Probabilistic and scientific modeling / Causal discovery

Recovering Causal Structures from Low-Order Conditional Independencies

Marcel Wienöbst, Maciej Liskiewicz

AAAI 2020 · Probabilistic and scientific modeling › Causal discovery · approach: Identifiability with hidden confounders · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use LOCI to remove edges between incompatible nodes from the 0-1 graphLow-order CI causal structure estimation · Random DAGs, n=100 and expected degree d=3number of edges: 413{.}68 (0-1 graph) -> 266{.}92 (LOCI); 149{.}42 (true DAG)Improved
Use LOCI to remove edges between incompatible nodes from the 0-1 graphLow-order CI causal structure estimation · Random DAGs, n=100 and expected degree d=4number of edges: 1{,}061{.}39 (0-1 graph) -> 598{.}11 (LOCI); 199{.}34 (true DAG)Improved
Use LOCI to remove edges between incompatible nodes from the 0-1 graphLow-order CI causal structure estimation · Random DAGs, n=100 and expected degree d=2number of edges: 125{.}87 (0-1 graph) -> 113{.}37 (LOCI); 99{.}40 (true DAG)Improved
Use LOCI to remove edges between incompatible nodes from the 0-1 graphLow-order CI causal structure estimation · Random DAGs, n=60 and expected degree d=3number of edges: 226{.}03 (0-1 graph) -> 160{.}43 (LOCI); 88{.}55 (true DAG)Improved
Use LOCI's orientations from low-order CIsLOCI representation G · Random DAGs, n=100 and expected degree d=5shared v-structures per node: 3{.}872 (true DAG); 3{.}504 (in both)Improved
Represent the model with the full LOCI graph, including its extra edges and orientationsLOCI representation G · Random DAGs, n=100 and expected degree d=5v-structures per node: 161{.}390 (LOCI); 3{.}872 (true DAG)Hurt
Rely only on observed zero- and first-order CIs to remove corresponding edges0-1 graph · Random DAGs, n=100 and expected degree d=3number of edges: 413{.}68 (0-1 graph); 266{.}92 (LOCI); 149{.}42 (true DAG)Hurt
Require prior knowledge of the underlying DAG's topological orderCampos and Huete method · Low-order CI causal structure learningavailability of a causal representationHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy