Research map / Probabilistic and scientific modeling / Uncertainty and Gaussian processes
Learning Bayesian networks with ancestral constraints
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use EC tree instead of GOBNILP | exact structure learning · n=14, N=512, p=0.01 | time (sec): 634.19 -> 0.01 | Helped |
| use EC tree instead of GOBNILP | exact structure learning · n=12, N=512, p=0.25 | time (sec): 23.29 -> 70.19 | Hurt |
| use EC tree instead of GOBNILP | exact structure learning · n=14, N=512, p=1.00 | time (sec): 61.44 -> 21.18 | Helped |
| remove projected decomposable constraints (ablation) | EC tree · n=12 to 14, Tables 1 vs 2 | time | Hurt |
| remove projected constraints (ablation) | GOBNILP · n=12 vs n=14 | time | Mixed |
| raise proportion of ancestral constraints p from 0.00 to 0.25 | EC tree · n=20, N=512 | time (sec): 19.40 -> 507.02 | Hurt |
| raise proportion of ancestral constraints p from 0.25 to 1.00 | EC tree · n=18, N=512 | time (sec): 251.74 -> < | Helped |
| raise p from 0.00 to 1.00 | EC tree · n=18, N=512 | structural Hamming distance: 16.74 -> 0.72 | Helped |
| raise p from 0.00 to 1.00 | EC tree · n=20, N=8192 | structural Hamming distance: 7.22 -> 0.18 | Helped |
| increase dataset size N from 512 to 8192 | EC tree · n=20, p=0.25 | time (sec): 507.02 -> 153.81 | Helped |
| increase dataset size N from 512 to 8192 | EC tree · n=20, p=0.00 | structural Hamming distance: 23.44 -> 7.22 | Helped |
| increase variables n from 18 to 20 | EC tree · N=512, p=0.10 | time (sec): 149.40 -> 492.59 | Hurt |
Closest papers by meaning
- Learning Bayesian Networks in the Presence of Structural Side Information (AAAI 2022 · similarity 0.88)
- Differentiable Structure Learning with Ancestral Constraints (ICML 2025 · similarity 0.88)
- Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings (AAAI 2021 · similarity 0.88)
- Efficient Bayesian network structure learning via local Markov boundary search (NeurIPS 2021 · similarity 0.87)
- Extendable and Iterative Structure Learning Strategy for Bayesian Networks (ICLR 2025 · similarity 0.86)
- Decomposing Constraint Networks for Calculating c-Representations (AAAI 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.