Scaling up Hybrid Probabilistic Inference with Logical and Arithmetic Constraints via Message Passing

by   Zhe Zeng, et al.

Weighted model integration (WMI) is a very appealing framework for probabilistic inference: it allows to express the complex dependencies of real-world problems where variables are both continuous and discrete, via the language of Satisfiability Modulo Theories (SMT), as well as to compute probabilistic queries with complex logical and arithmetic constraints. Yet, existing WMI solvers are not ready to scale to these problems. They either ignore the intrinsic dependency structure of the problem at all, or they are limited to too restrictive structures. To narrow this gap, we derive a factorized formalism of WMI enabling us to devise a scalable WMI solver based on message passing, MP-WMI. Namely, MP-WMI is the first WMI solver which allows to: 1) perform exact inference on the full class of tree-structured WMI problems; 2) compute all marginal densities in linear time; 3) amortize inference inter query. Experimental results show that our solver dramatically outperforms the existing WMI solvers on a large set of benchmarks.


page 1

page 2

page 3

page 4


Hybrid Probabilistic Inference with Logical Constraints: Tractability and Message-Passing

Weighted model integration (WMI) is a very appealing framework for proba...

Approximate Counting in SMT and Value Estimation for Probabilistic Programs

#SMT, or model counting for logical theories, is a well-known hard probl...

SMT-based Weighted Model Integration with Structure Awareness

Weighted Model Integration (WMI) is a popular formalism aimed at unifyin...

Hybrid SRL with Optimization Modulo Theories

Generally speaking, the goal of constructive learning could be seen as, ...

Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths

We present an efficient approximate message passing solver for the lifte...

Monte Carlo Anti-Differentiation for Approximate Weighted Model Integration

Probabilistic inference in the hybrid domain, i.e. inference over discre...

Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty

Stochastic Boolean Satisfiability (SSAT) is a logical formalism to model...