Beyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function
نویسنده
چکیده
A recent result has demonstrated that the Bethe partition function always lower bounds the true partition function of binary, logsupermodular graphical models. We demonstrate that these results can be extended to other interesting classes of graphical models that are not necessarily binary or log-supermodular: the ferromagnetic Potts model with a uniform external field and its generalizations and special classes of weighted graph homomorphism problems.
منابع مشابه
The Bethe Partition Function of Log-supermodular Graphical Models
Sudderth, Wainwright, and Willsky conjectured that the Bethe approximation corresponding to any fixed point of the belief propagation algorithm over an attractive, pairwise binary graphical model provides a lower bound on the true partition function. In this work, we resolve this conjecture in the affirmative by demonstrating that, for any graphical model with binary variables whose potential f...
متن کاملFactor models on locally tree-like graphs
We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree T , and study the existence of the free energy density φ, the limit of the log-partition function divided by the number of vertices n as n tends to infinity. We provide a new interpolation scheme and use it to prove existence of, and to explicitly compute, the quantity φ su...
متن کاملBelief Propagation, Mean-field, and Bethe approximations
This chapter describes methods for estimating the marginals and maximum a posteriori (MAP) estimates of probability distributions defined over graphs by approximate methods including Mean Field Theory (MFT), variational methods, and belief propagation. These methods typically formulate this problem in terms of minimizing a free energy function of pseudomarginals. They differ by the design of th...
متن کاملApproximating the Bethe Partition Function
When belief propagation (BP) converges, it does so to a stationary point of the Bethe free energy F , and is often strikingly accurate. However, it may converge only to a local optimum or may not converge at all. An algorithm was recently introduced by Weller and Jebara for attractive binary pairwise MRFs which is guaranteed to return an !-approximation to the global minimum of F in polynomial ...
متن کاملLoop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed to provide lower bounds, whereas certain types of convex relaxations provide upper bounds. In general, loopy belief propagation (BP) provides often accurate approximations, but not bounds. We prove that for a class of at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1309.6859 شماره
صفحات -
تاریخ انتشار 2013