atlas

Research map / Probabilistic and scientific modeling / Uncertainty and Gaussian processes

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning

AAAI 2021 · Probabilistic and scientific modeling › Uncertainty and Gaussian processes · approach: Approximate inference in Bayesian neural networks · 11 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
Apply local exact MaxSAT improvement to heuristic solutionsk-MAX, ETL-d, and ETL-p solutions · Treewidth-bounded BN structure learning, treewidth bounds 2, 5, and 8instances with extremely positive evidence (ΔBIC ≥ 10): 95%, 79%, and 78%Helped
Apply BN-SLIM for 5 minutesHeuristically computed DAGs · Benchmark DAGsDAGs improved: 73%Helped
Extend BN-SLIM runtime to 15 minutesHeuristically computed DAGs · Benchmark DAGsDAGs improved: 82%Helped
Hand optimization from k-MAX to BN-SLIM after an initial runk-MAX solutions · Treewidth-bounded BN structure learningΔBIC improvement rateHelped
Apply BN-SLIM after ETL finishesETL-d and ETL-p solutions · Treewidth-bounded BN structure learninginstances with extremely positive evidence (ΔBIC): 84%Helped
Compare BN-SLIM(k-MAX) against k-MAX in a one-hour racek-MAX · Treewidth bound 2ΔBICHelped
Use a lower treewidth boundBN-SLIM · Treewidth-bounded BN structure learningimprovement efficiencyHelped

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