资源分类
》 资源 》论文》The Bethe Partition Function of Log-supermodular Graphical Models

The Bethe Partition Function of Log-supermodular Graphical Models

2020-01-13 | |  46 |   43 |   0

Abstract

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 functions (not necessarily pairwise) are all log-supermodular, the Bethe partition function always lower bounds the true partition function. The proof of this result follows from a new variant of the “four functions” theorem that may be of independent interest.

上一篇：Minimizing Sparse High-Order Energies by Submodular Vertex-Cover

下一篇：Nonconvex Penalization Using Laplace Exponents and Concave Conjugates

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...