Research map / Probabilistic and scientific modeling / Causal discovery
Title
Robert Ganian, Thekla Hamm, Topi Talvitie
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 AnonMAO instead of RootPicking DP | #MAO counting · Random chordal graphs, n 32-1024, density r 2-32 | running time | Improved |
| use AnonMAO instead of He and Yu 2016 | #MAO counting · Random chordal graphs, n 32-1024, density r 2-32 | running time | Improved |
| use AnonMAO instead of DP in tree decomposition on very sparse graphs | #MAO counting · Random chordal graphs, n 32-1024, density r 2-32 (very sparse) | running time | Hurt |
| use AnonMAO instead of tree decomposition DP on dense graphs | #MAO counting · Random chordal graphs, n 32-1024, density r 2-32 (dense) | running time | Improved |
Closest papers by meaning
- A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton (AAAI 2024 · similarity 0.90)
- An Improved Clique-Picking Algorithm for Counting Markov Equivalent DAGs via Super Cliques Transfer (ICML 2025 · similarity 0.87)
- Causal Discovery with Fewer Conditional Independence Tests (ICML 2024 · similarity 0.86)
- Interventional Causal Discovery in a Mixture of DAGs (NeurIPS 2024 · similarity 0.86)
- Sample Efficient Bayesian Learning of Causal Graphs from Interventions (NeurIPS 2024 · similarity 0.85)
- QWO: Speeding Up Permutation-Based Causal Discovery in LiGAMs (NeurIPS 2024 · similarity 0.85)
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.
