Convexifying the Bethe Free Energy

05/09/2012
by   Ofer Meshi, et al.
0

The introduction of loopy belief propagation (LBP) revitalized the application of graphical models in many domains. Many recent works present improvements on the basic LBP algorithm in an attempt to overcome convergence and local optima problems. Notable among these are convexified free energy approximations that lead to inference procedures with provable convergence and quality properties. However, empirically LBP still outperforms most of its convex variants in a variety of settings, as we also demonstrate here. Motivated by this fact we seek convexified free energies that directly approximate the Bethe free energy. We show that the proposed approximations compare favorably with state-of-the art convex free energy approximations.

READ FULL TEXT

page 4

page 7

research
06/14/2019

Amortized Bethe Free Energy Minimization for Learning MRFs

We propose to learn deep undirected graphical models (i.e., MRFs), with ...
research
10/19/2012

Approximate Inference and Constrained Optimization

Loopy and generalized belief propagation are popular algorithms for appr...
research
01/10/2013

Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation

We present a novel inference algorithm for arbitrary, binary, undirected...
research
01/28/2022

Regionalized optimization

Yedidia, Freeman, Weiss have shown in their reference article, "Construc...
research
07/02/2022

Local Max-Entropy and Free Energy Principles Solved by Belief Propagation

A statistical system is classically defined on a set of microstates E by...
research
12/12/2012

A New Class of Upper Bounds on the Log Partition Function

Bounds on the log partition function are important in a variety of conte...
research
01/15/2013

Learning Graphical Model Parameters with Approximate Marginal Inference

Likelihood based-learning of graphical models faces challenges of comput...

Please sign up or login with your details

Forgot password? Click here to reset