Research map / Probabilistic and scientific modeling / Causal discovery
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications
Marcel Wienöbst, Max Bannach, Maciej Liśkiewicz
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use Clique-Picking to count interventional MECs in MinMaxMEC, MaxEntropy and OptSingle on dense graphs | MinMaxMEC, MaxEntropy, OptSingle · Active learning, dense chordal graphs | max feasible graph size (vertices): up to 30 vertices, compared to 14 previously | Improved |
| use Clique-Picking and linear-time interventional essential graph update on sparse graphs | MinMaxMEC, MaxEntropy, OptSingle · Active learning, sparse chordal graphs | max feasible graph size (vertices): graphs with 500 vertices in about 10-15 minutes | Improved |
| choose interventions by MEC size (MinMaxMEC, MaxEntropy, OptSingle) instead of other strategies | active learning of causal DAGs · Active learning, sparse and dense graphs | number of interventions | Improved |
| add multiplicity computation (global-IDA) on top of causal effect estimation (local-IDA) | IDA with PC-algorithm CPDAG · IDA, 100 replicates, 99 covariates | mean runtime (s): 0.27393 vs 0.00172 | No clear effect |
| compute multiplicities with Clique-Picking on riboflavin data (4088 covariates) | global-IDA · Riboflavin | mean runtime (s): 0.48184 vs 0.07042 | Improved |
Closest papers by meaning
- Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs (AAAI 2021 · similarity 0.97)
- Counting and Sampling from Markov Equivalent DAGs Using Clique Trees (AAAI 2019 · similarity 0.93)
- A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton (AAAI 2024 · similarity 0.92)
- Coarsening Linear Non-Gaussian Causal Models with Cycles (NeurIPS 2026 · similarity 0.90)
- Sample Efficient Bayesian Learning of Causal Graphs from Interventions (NeurIPS 2024 · similarity 0.88)
- Causal Abstractions, Categorically Unified (NeurIPS 2026 · similarity 0.88)
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.
