Mean Field Methods for a Special Class of Belief Networks

06/01/2011
by   C. Bhattacharyya, et al.
0

The chief aim of this paper is to propose mean-field approximations for a broad class of Belief networks, of which sigmoid and noisy-or networks can be seen as special cases. The approximations are based on a powerful mean-field theory suggested by Plefka. We show that Saul, Jaakkola and Jordan' s approach is the first order approximation in Plefka's approach, via a variational derivation. The application of Plefka's theory to belief networks is not computationally tractable. To tackle this problem we propose new approximations based on Taylor series. Small scale experiments show that the proposed schemes are attractive.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 17

page 18

01/16/2013

Variational Approximations between Mean Field Theory and the Junction Tree Algorithm

Recently, variational approximations such as the mean field approximatio...
02/14/2012

Factored Filtering of Continuous-Time Systems

We consider filtering for a continuous-time, or asynchronous, stochastic...
07/10/2012

Comparative Study for Inference of Hidden Classes in Stochastic Block Models

Inference of hidden classes in stochastic block model is a classical pro...
03/29/2018

Copula Variational Bayes inference via information geometry

Variational Bayes (VB), also known as independent mean-field approximati...
03/15/2012

Negative Tree Reweighted Belief Propagation

We introduce a new class of lower bounds on the log partition function o...
05/26/2016

Adiabatic Persistent Contrastive Divergence Learning

This paper studies the problem of parameter learning in probabilistic gr...
08/25/2020

Rate Equations for Graphs

In this paper, we combine ideas from two different scientific traditions...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.