AI Paper Atlas

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

Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration

Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier, Devon Graham

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

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 SPC's anytime search instead of LB with fixed ε,δ choicesAlgorithm configuration for minisat · minisat configurations on SAT instancesCPU time to identify a configuration in the top 1% by max-capped runtime: about 10 CPU days for SPC; at least 100 CPU days for every LB ε,δ combination consideredImproved
Continue the anytime SPC searchSPC · minisat configurations on SAT instancesbest configuration reached: about 100 CPU days; about 525 CPU daysImproved
Choose fixed ε,δ values for LBLeapsAndBounds (LB) · minisat configurations on SAT instancesquality of returned configurationMixed

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