Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies

• Published in: The Journal of artificial intelligence research Vol. 26; pp. 153 - 190
• Main Author: Heskes, T.
• Format: Journal Article
• Language: English
• Published: San Francisco AI Access Foundation 01-01-2006
• Subjects: Algorithms; Artificial intelligence; Bayesian analysis; Convexity; Fields (mathematics); Free energy; Optimization; Propagation; Upper bounds
• ISSN: 1076-9757; 1076-9757; 1943-5037
• DOI: 10.1613/jair.1933

Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been shown to correspond to extrema of the Bethe and Kikuchi free energy, both of which are approximations of the exact Helmholtz free energy. However, belief propagation does not always converge, which motivates approaches that explicitly minimize the Kikuchi/Bethe free energy, such as CCCP and UPS.
Here we describe a class of algorithms that solves this typically non-convex constrained minimization problem through a sequence of convex constrained minimizations of upper bounds on the Kikuchi free energy. Intuitively one would expect tighter bounds to lead to faster algorithms, which is indeed convincingly demonstrated in our simulations. Several ideas are applied to obtain tight convex bounds that yield dramatic speed-ups over CCCP.