54 citations · 125 across the 18 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013★ 10 cited
Beyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function
Nicholas Ruozzi
A recent result has demonstrated that the Bethe partition function always lower bounds the true partition function of binary, log-supermodular graphical models. We demonstrate that…
cs.DM2012★ 54 cited
The Bethe Partition Function of Log-supermodular Graphical Models
Nicholas Ruozzi
Sudderth, Wainwright, and Willsky have conjectured that the Bethe approximation corresponding to any fixed point of the belief propagation algorithm over an attractive, pairwise bi…