Title of article
Approximate inference in Boltzmann machines Original Research Article
Author/Authors
Max Welling، نويسنده , , Yee Whye Teh، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
32
From page
19
To page
50
Abstract
Inference in Boltzmann machines is NP-hard in general. As a result approximations are often necessary. We discuss first order mean field and second order Onsager truncations of the Plefka expansion of the Gibbs free energy. The Bethe free energy is introduced and rewritten as a Gibbs free energy. From there a convergent belief optimization algorithm is derived to minimize the Bethe free energy. An analytic expression for the linear response estimate of the covariances is found which is exact on Boltzmann trees. Finally, a number of theorems is proven concerning the Plefka expansion, relating the first order mean field and the second order Onsager approximation to the Bethe approximation. Experiments compare mean field approximation, Onsager approximation, belief propagation and belief optimization.
Keywords
Loopy Belief Propagation , Boltzmann machines , Inference , Advanced mean field methods
Journal title
Artificial Intelligence
Serial Year
2003
Journal title
Artificial Intelligence
Record number
1207216
Link To Document