Log In Sign Up

Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms

by   Uri Lerner, et al.

An important subclass of hybrid Bayesian networks are those that represent Conditional Linear Gaussian (CLG) distributions --- a distribution with a multivariate Gaussian component for each instantiation of the discrete variables. In this paper we explore the problem of inference in CLGs. We show that inference in CLGs can be significantly harder than inference in Bayes Nets. In particular, we prove that even if the CLG is restricted to an extremely simple structure of a polytree in which every continuous node has at most one discrete ancestor, the inference task is NP-hard.To deal with the often prohibitive computational cost of the exact inference algorithm for CLGs, we explore several approximate inference algorithms. These algorithms try to find a small subset of Gaussians which are a good approximation to the full mixture distribution. We consider two Monte Carlo approaches and a novel approach that enumerates mixture components in order of prior probability. We compare these methods on a variety of problems and show that our novel algorithm is very promising for large, hybrid diagnosis problems.


page 1

page 2

page 4

page 5

page 6

page 7

page 8


Gaussian Mixture Reduction for Time-Constrained Approximate Inference in Hybrid Bayesian Networks

Hybrid Bayesian Networks (HBNs), which contain both discrete and continu...

Exact Inference in Networks with Discrete Children of Continuous Parents

Many real life domains contain a mixture of discrete and continuous vari...

Expectation Propagation for approximate Bayesian inference

This paper presents a new deterministic approximation technique in Bayes...

Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints

In this paper, we consider Hybrid Mixed Networks (HMN) which are Hybrid ...

A Variational Approximation for Bayesian Networks with Discrete and Continuous Latent Variables

We show how to use a variational approximation to the logistic function ...

Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm

We consider the problem of approximating a two-dimensional shape contour...

Performing Bayesian Risk Aggregation using Discrete Approximation Algorithms with Graph Factorization

Risk aggregation is a popular method used to estimate the sum of a colle...