atlas

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

Finding All Bayesian Network Structures within a Factor of Optimal

AAAI 2019 · Probabilistic and scientific modeling › Uncertainty and Gaussian processes · approach: Approximate inference in Bayesian neural networks · 12 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
Enumerate networks within a Bayes-factor threshold instead of requesting a fixed k-best setGOBNILP_dev for Bayesian network averaging · BDeu benchmarkssearch time: 70.7 -> 0.6Helped
Use BF=20 enumeration rather than KBest at k=1,000GOBNILP_dev versus KBest · adult (BDeu)search time: 2,122.8 -> 9.3Helped
Use BF-based enumeration instead of KBestBayesian network averaging · datasets with very large sample sizessearch timeMixed
Generalize pruning rules to preserve near-optimal parent setsGOBNILP_dev with BIC · Bayesian network datasetsmaximum demonstrated number of variables: 29 -> 57Helped
Choose the number of networks by a fixed k rather than a score-based credibility thresholdModel averaging with k-best solvers · datasets with different score patternscoverage of credible networksMixed

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