Research map / Learning theory and algorithms / Combinatorial and search optimization
Inference in Graphical Models via Semidefinite Programming Hierarchies
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use triangle-region PSOS(4) with CLAP rounding instead of BP or GBP | MAP inference on 2D-grid Ising spin glasses · Ising spin glasses, 800 experiments | objective value | Helped |
| Use triangle-region PSOS(4) with CLAP rounding instead of BP or GBP | binary-image denoising · 2D-grid image denoising, i.i.d. and blockwise noise | reconstruction quality | Helped |
| Increase the Burer-Monteiro rank beyond 10 (ablation) | PSOS(4) · n=400 square lattice | objective value | No clear effect |
Closest papers by meaning
- Efficient semidefinite-programming-based inference for binary and multi-class MRFs (NeurIPS 2020 · similarity 0.89)
- Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation (AAAI 2018 · similarity 0.89)
- Maximum A Posteriori Inference in Sum-Product Networks (AAAI 2018 · similarity 0.89)
- Beyond Trees: Analysis and Convergence of Belief Propagation in Graphs with Multiple Cycles (AAAI 2020 · similarity 0.88)
- The Linearization of Belief Propagation on Pairwise Markov Random Fields (AAAI 2017 · similarity 0.88)
- Convergence of Some Convex Message Passing Algorithms to a Fixed Point (ICML 2024 · similarity 0.86)
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.