Publication
Exploiting Causal Independence Using Weighted Model Counting
AbstractPrevious studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be an effective method for exact inference in Bayesian networks. In this paper, we present techniques for improving this approach for Bayesian networks with noisy-OR and noisy-MAX relations—two relations which are widely used in practice as they can dramatically reduce thenumber of probabilities one needs to specify. In particular, we present two space efficient CNF encodings for noisy-OR/MAX and explore alternative search ordering heuristics. 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 ordersof magnitude over the best previous approaches and scaled up to networks with larger numbers of random variables.
Download publicationRelated Resources
See what’s new.
2022
Capturing Designers’ Experiential Knowledge in Scalable Representation Systems: A Case Study of Knowledge Graphs for Product TeardownsThis research develops a searchable knowledge graph to capture and…
2019
Unsupervised Multi-Task Feature Learning on Point CloudsWe introduce an unsupervised multi-task model to jointly learn point…
2014
Retrieving Causally Related Functions from Natural-language Text for Biomimetic DesignIdentifying biological analogies is a significant challenge in…
2011
DesignScript: Origins, Explanation, IllustrationDesignScript, as the name suggests, is positioned at the intersection…
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