AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Active Structure Learning of Causal DAGs via Directed Clique Trees

Chandler Squires, Sara Magliacane, Kristjan Greenewald, Dmitriy Katz, Murat Kocaoglu, Karthikeyan Shanmugam

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning · 9 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 DCT policy instead of OptSingle/GreedyMEC/GreedyEntropy for intervention designintervention policy · Synthetic small DAGscomputation time: >10 seconds -> .1 secondsImproved
use DCT policy instead of other scalable/costly policiesintervention policy · Synthetic small DAGsaverage ic-ratio: 1.4-1.7xNo clear effect
use DCT policy instead of Coloring policyintervention policy · Synthetic large tree-like DAGsmaximum ic-ratioImproved
use DCT policy instead of Coloring policyintervention policy · Synthetic large tree-like DAGsaverage ic-ratio: 2-3 timesNo clear effect
use ND-Random instead of structured policiesintervention policy · Synthetic small DAGsaverage ic-ratioHurt

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