atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Synthesis of MCMC and Belief Propagation

NeurIPS 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Correct BP error with MCMC over 2-regular loop series (MCMC-BP-2reg) instead of bare BPIsing model with no external field on 4x4 grid · 4x4 grid, glassy interactions N(0.3,0.5^2)log-partition function approximation errorHelped
Correct BP error with MCMC over full loop series (MCMC-BP-whole) instead of bare BPIsing model with external fields and hard-core model on 4x4 grid · 4x4 grid, Ising with fields and hard-core modellog-partition function approximation errorHelped
Use BP-aware MCMC (MCMC-BP-2reg/whole) instead of plain Gibbs sampler MCMCIsing and hard-core models on 4x4 grid · 4x4 gridlog-partition function approximation errorHelped
Advantage of BP-corrected MCMC is larger when BP error is largeBP-corrected MCMC schemes · 4x4 grid experimentslog-partition function approximation errorNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy