Research map / Learning theory and algorithms / Combinatorial and search optimization
Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation
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.
Closest papers by meaning
- Exact MAP Inference by Avoiding Fractional Vertices (ICML 2017 · similarity 0.92)
- Solving Relaxations of MAP-MRF Problems: Combinatorial In-Face Frank-Wolfe Directions (CVPR 2023 · similarity 0.89)
- Inference in Graphical Models via Semidefinite Programming Hierarchies (NeurIPS 2017 · similarity 0.89)
- Anytime Best+Depth-First Search for Bounding Marginal MAP (AAAI 2017 · similarity 0.88)
- Continuous Relaxation of MAP Inference: A Nonconvex Perspective (CVPR 2018 · similarity 0.88)
- Convergence of Some Convex Message Passing Algorithms to a Fixed Point (ICML 2024 · similarity 0.85)
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.