Publication
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
AbstractPrevious studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an effective method for exact inference. In this paper, we present techniques for improving this approach for Bayesian networks with noisy-OR and noisy-MAX relations— two relations that are widely used in practice as they can dramatically reduce the number of probabilities one needs to specify. In particular, we present two SAT encodings for noisy-OR and two encodings for noisy-MAX that exploit the structure or semantics of the relations to improve both time and space efficiency, and we prove the correctness of the encodings. We experimentally evaluated our techniques on large-scale real and randomly generated Bayesian networks. On these benchmarks, our techniques gave speedups of up to two orders of magnitude over the best previous approaches for networks with noisy- OR/MAX relations and scaled up to larger networks. As well, our techniques extend the weighted model counting approach for exact inference to networks that were previously intractable for the approach.
Download publicationRelated Resources
See what’s new.
2021
RobustPointSet: A Dataset for Benchmarking Robustness of Point Cloud ClassifiersThe 3D deep learning community has seen significant strides in…
2023
Six Generative Design Pitfalls to Avoid – Part OneVisiting Professor Peter Bentley shares his thoughts and expertise on…
2023
Teaching Robots to Cooperate in Strange New WorldsLearn how researchers at Autodesk are collaborating with NASA’s RETHI…
Get in touch
Something pique your interest? Get in touch if you’d like to learn more about Autodesk Research, our projects, people, and potential collaboration opportunities.
Contact us