首页 | 本学科首页   官方微博 | 高级检索  
     


Approximate inference in Boltzmann machines
Authors:Max Welling  Yee Whye Teh
Affiliation:Department of Computer Science, University of Toronto, 6 King's College Road, Toronto, M5S 3G5 Canada
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:Advanced mean field methods  Loopy belief propagation  Inference  Boltzmann machines
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号