Publication
Performing Incremental Bayesian Inference by Dynamic Model Counting
AbstractThe ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 2005) demonstrates that the well-known Davis-Putnam procedure combined with a dynamic decomposition and caching technique is an effective method for exact inference in Bayesian networks with high density and width. In this paper, we define dynamic model counting and extend the dynamic decomposition and caching technique to multiple runs on a series of problems with similar structure. This allows us to perform Bayesian inference incrementally as the structure of the network changes. Experimental results show that our approach yields significant improvements over the previous model counting approaches on multiple challenging Bayesian network instances.
Download publicationRelated Resources
See what’s new.
1996
Random Caustics: Natural Textures and Wave Theory RevisitedA technique to synthesizes caustic texture maps is presented…
2011
TouchCuts and TouchZoom: Enhanced Target Selection for Touch Displays using Finger Proximity SensingAlthough touch-screen laptops are increasing in popularity, users…
2011
On the Velocity of an Implicit SurfaceIn this paper we derive an equation for the velocity of an arbitrary…
2017
Multiscale Representation of Simulated TimeTo better support multiscale modeling and simulation, we present a…
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