papers AI Learner
The Github is limit! Click to go to the new site.

Efficient Search-Based Weighted Model Integration

2019-03-13
Zhe Zeng, Guy Van den Broeck

Abstract

Weighted model integration (WMI) extends Weighted model counting (WMC) to the integration of functions over mixed discrete-continuous domains. It has shown tremendous promise for solving inference problems in graphical models and probabilistic programming. Yet, state-of-the-art tools for WMI are limited in terms of performance and ignore the independence structure that is crucial to improving efficiency. To address this limitation, we propose an efficient model integration algorithm for theories with tree primal graphs. We exploit the sparse graph structure by using search to performing integration. Our algorithm greatly improves the computational efficiency on such problems and exploits context-specific independence between variables. Experimental results show dramatic speedups compared to existing WMI solvers on problems with tree-shaped dependencies.

Abstract (translated by Google)
URL

http://arxiv.org/abs/1903.05334

PDF

http://arxiv.org/pdf/1903.05334


Similar Posts

Comments