English

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

Artificial Intelligence 2013-01-30 v1 Machine Learning Machine Learning

Abstract

We show how to use a variational approximation to the logistic function to perform approximate inference in Bayesian networks containing discrete nodes with continuous parents. Essentially, we convert the logistic function to a Gaussian, which facilitates exact inference, and then iteratively adjust the variational parameters to improve the quality of the approximation. We demonstrate experimentally that this approximation is faster and potentially more accurate than sampling. We also introduce a simple new technique for handling evidence, which allows us to handle arbitrary distributions on observed nodes, as well as achieving a significant speedup in networks with discrete variables of large cardinality.

Keywords

Cite

@article{arxiv.1301.6724,
  title  = {A Variational Approximation for Bayesian Networks with Discrete and Continuous Latent Variables},
  author = {Kevin Murphy},
  journal= {arXiv preprint arXiv:1301.6724},
  year   = {2013}
}

Comments

Appears in Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI1999)

R2 v1 2026-06-21T23:16:44.431Z