atlas

Research map / Graph learning / Graph algorithms and clustering

Constraint-based Causal Structure Learning with Consistent Separating Sets

NeurIPS 2019 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 13 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
enforce sepset consistency (iterative consistent PC-stable) instead of original PC-stablePC-stable · BNlearn Hepar2/Insurance/Barley, N=1000recall at max F-score: Rec<0.15-0.35 -> Rec0.5Helped
enforce sepset consistency instead of original PC-stablePC-stable · BNlearn Hepar2/Insurance/Barley, N=1000precision at max F-score: Prec>0.65 -> Prec0.5-0.6Hurt
enforce sepset consistencyPC-stable · scale-free DAGs, 50 nodes, linear SEM, N=500adjacency recall and precisionHelped
enforce sepset consistencyPC-stable · scale-free DAGsfraction of valid d-separation sepsetsHelped
skeleton-level consistency (Alg. 4) instead of orientation-level consistency (Alg. 3) (ablation)Consistent PC-stable · scale-free DAGsvalid d-separation and performanceHelped
larger sample size or stronger interactionsoriginal PC-stable · scale-free DAGsfraction of inconsistent sepsetsHelped

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