AI Paper Atlas

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

Learning to Solve Quadratic Unconstrained Binary Optimization in a Classification Way

NeurIPS 2024 · Learning theory and algorithms › Combinatorial and search optimization · approach: Constrained neural network optimization · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

placeholder

Problem

placeholder

Approach

placeholder

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use VCM50 instead of BGFQUBO solver · B2500(10)GAP (%): 0.807 -> 0.362Helped
Use VCM50 instead of BGFQUBO solver · P3000(5)GAP (%): 0.979 -> 0.861Helped
Use VCM50 instead of BGFQUBO solver · P4000(5)GAP (%): 0.834 -> 0.669Helped
Use VCM50 instead of BGFQUBO solver · P5000(5)GAP (%): 0.914 -> 0.783Helped
Use VCM50 instead of BGFQUBO solver · P6000(3)GAP (%): 0.966 -> 0.806Helped
Use VCM50 instead of BGFQUBO solver · P7000(3)GAP (%): 0.730 -> 0.702Helped
Extend testing DVN depth from 40 to 300 (ablation)VCM50-d40 · B2500(10)GAP (%): 0.362 -> 0.034Helped
Increase training DVN depth from 10 to 30 (ablation)VCM50 · B2500(10)GAP (%): 0.633 -> 0.396Helped

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