ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,A)G=(V,\mathcal{A}) be a factor graph and let f:{0,1}n→R≥0f:\mathbb{\{0,1\}}^n\to\mathbb{R}_{\geq 0} admit a pairwise, log-supermodular factorization over GG. Let Z(G)=∑xf(x)Z(G)=\sum_x f(x) be the true partition function, and let ZB(G)Z_\mathrm{B}(G) denote the maximum Bethe approximation over the local marginal polytope.

Sudderth–Wainwright–Willsky conjecture. If ff admits a pairwise, log-supermodular factorization over GG, then

ZB(G)≤Z(G).Z_\mathrm{B}(G)\leq Z(G).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.