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

09/20/2019
by   Zhe Zeng, et al.
5

Weighted model integration (WMI) is a very appealing framework for probabilistic inference: it allows to express the complex dependencies of real-world hybrid scenarios where variables are heterogeneous in nature (both continuous and discrete) via the language of Satisfiability Modulo Theories (SMT); as well as computing probabilistic queries with arbitrarily complex logical constraints. Recent work has shown WMI inference to be reducible to a model integration (MI) problem, under some assumptions, thus effectively allowing hybrid probabilistic reasoning by volume computations. In this paper, we introduce a novel formulation of MI via a message passing scheme that allows to efficiently compute the marginal densities and statistical moments of all the variables in linear time. As such, we are able to amortize inference for arbitrarily rich MI queries when they conform to the problem structure, here represented as the primal graph associated to the SMT formula. Furthermore, we theoretically trace the tractability boundaries of exact MI. Indeed, we prove that in terms of the structural requirements on the primal graph that make our MI algorithm tractable - bounding its diameter and treewidth - the bounds are not only sufficient, but necessary for tractable inference via MI.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/28/2020

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

Weighted model integration (WMI) is a very appealing framework for proba...
06/28/2022

SMT-based Weighted Model Integration with Structure Awareness

Weighted Model Integration (WMI) is a popular formalism aimed at unifyin...
07/02/2018

Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programming

In probabilistic reasoning, the traditionally discrete domain has been e...
09/29/2019

Policy Message Passing: A New Algorithm for Probabilistic Graph Inference

A general graph-structured neural network architecture operates on graph...
01/08/2020

Lifted Hybrid Variational Inference

A variety of lifted inference algorithms, which exploit model symmetry t...
03/25/2021

Measure Theoretic Weighted Model Integration

Weighted model counting (WMC) is a popular framework to perform probabil...
03/13/2019

Efficient Search-Based Weighted Model Integration

Weighted model integration (WMI) extends Weighted model counting (WMC) t...