atlas

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

Combinatorial Persistency Criteria for Multicut and Max-Cut

CVPR 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 12 citations (OpenAlex)

Check 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
Apply the proposed persistency criteria instead of prior criteria [2, 29]Multicut instances · Multicut benchmarks in Table 2remaining graph sizeHelped
Apply the proposed persistency methodIsing Chain · Ising Chainremaining nodes and edges: 0.0%Helped
Apply the proposed persistency method2D Torus · 2D Torusremaining graph size: 23.6%; 27.9%Helped
Apply the proposed persistency method3D Torus · 3D Torusremaining graph size: 94.8%; 98.1%Hurt
Apply the proposed method rather than QPBO [34]Deconvolution · Deconvolutionremaining graph size: 61.0%; 56.5%No clear effect
Apply the proposed method rather than QPBO [34]Super Resolution · Super Resolutionremaining graph size: 0.0% vs 0.2%; 0.0% vs 0.1%Helped
Apply the proposed method rather than QPBO [34]Texture Restoration · Texture Restorationremaining graph size: 98.4%; 98.5% vs 58.8%; 57.3%Mixed

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