Sudderth–Wainwright–Willsky conjecture on the Bethe partition function
Statement
Let be a factor graph and let admit a pairwise, log-supermodular factorization over . Let be the true partition function, and let denote the maximum Bethe approximation over the local marginal polytope.
Sudderth–Wainwright–Willsky conjecture. If admits a pairwise, log-supermodular factorization over , then
This conjecture asserts that the Bethe partition function is a lower bound on the true partition function for attractive pairwise binary graphical models. The paper studies this conjecture and proves the bound under the stated log-supermodularity assumptions.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.