atlas

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

Exact MAP Inference by Avoiding Fractional Vertices

ICML 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 1 citations (OpenAlex)

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
Use branch-and-bound to prune confounding fractional vertices0-1 ILP · 0-1 ILP with M confounding verticesLP solver calls: 2MHelped
Use branch-and-bound based on fractional singleton marginalsGraphical-model MAP inference · Graphical-model MAP inferenceLP solver calls: 2 |S(V_C)|Helped
Add cycle inequalities to remove confounding singleton marginalsBinary pairwise graphical models · Synthetic complete graphs on 12 nodesconfounding singleton marginals removed per constraintHelped
Use branch-and-bound rather than cycle constraintsBinary pairwise graphical models · Synthetic complete graphs on 12 nodesLP solver callsHelped
Increase connection strength wRandom binary pairwise graphical models · Synthetic complete graphs on 12 nodesnumber of confounding singleton marginalsHurt
Enumerate the M-best LP verticesLP relaxation · M-best LP problemcomputational tractability: M = O(n^ε)Hurt

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