ISSN:
0885-6125
Keywords:
graphical models
;
Bayesian networks
;
belief networks
;
probabilistic inference
;
approximate inference
;
variational methods
;
mean field methods
;
hidden Markov models
;
Boltzmann machines
;
neural networks
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract This paper presents a tutorial introduction to the use of variational methods for inference and learning in graphical models (Bayesian networks and Markov random fields). We present a number of examples of graphical models, including the QMR-DT database, the sigmoid belief network, the Boltzmann machine, and several variants of hidden Markov models, in which it is infeasible to run exact inference algorithms. We then introduce variational methods, which exploit laws of large numbers to transform the original graphical model into a simplified graphical model in which inference is efficient. Inference in the simpified model provides bounds on probabilities of interest in the original model. We describe a general framework for generating variational transformations based on convex duality. Finally we return to the examples and demonstrate how variational algorithms can be formulated in each case.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1007665907178
Permalink
