Tree-reweighted Belief Propagation Algorithms and Approximate ML Estimation by Pseudo-Moment Matching
Martin J. Wainwright, Tommi Jaakkola, Alan S. Willsky · 2003
In previous work [10], we presented a class of upper bounds on the log partition function of an arbitrary undirected graphical model based on solving a convex variational problem. Here we develop a class of local message-passing algorithms, which we call tree-reweighted belief propagation, for ef- ciently computing the value of these upper bounds, as well as the associated pseudomarginals.