
Scaling up Hybrid Probabilistic Inference with Logical and Arithmetic Constraints via Message Passing
Weighted model integration (WMI) is a very appealing framework for proba...
read it

Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programming
In probabilistic reasoning, the traditionally discrete domain has been e...
read it

Policy Message Passing: A New Algorithm for Probabilistic Graph Inference
A general graphstructured neural network architecture operates on graph...
read it

Replicated Vector Approximate Message Passing For Resampling Problem
Resampling techniques are widely used in statistical inference and ensem...
read it

Lifted Hybrid Variational Inference
A variety of lifted inference algorithms, which exploit model symmetry t...
read it

Efficient SearchBased Weighted Model Integration
Weighted model integration (WMI) extends Weighted model counting (WMC) t...
read it

Accelerating Message Passing for MAP with Benders Decomposition
We introduce a novel mechanism to tighten the local polytope relaxation ...
read it
Hybrid Probabilistic Inference with Logical Constraints: Tractability and MessagePassing
Weighted model integration (WMI) is a very appealing framework for probabilistic inference: it allows to express the complex dependencies of realworld 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
Comments
There are no comments yet.