atlas

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

LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration

ICML 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 8 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 LeapsAndBounds instead of Structured ProcrastinationMiniSAT configuration search · CNFuzzDD SAT benchmark, no resumetotal runtime (CPU days): 933.50 vs 1850.46 CPU daysHelped
Use LeapsAndBounds instead of Structured ProcrastinationMiniSAT configuration search · CNFuzzDD SAT benchmark, with resumetotal runtime (days): 368.50 vs 1169.36 daysHelped
Add empirical Bernstein stopping to RuntimeEst (ablation)LeapsAndBounds · Low-variance runtime distributionssamples evaluated per phase: ε^{-1} rather than ε^{-2}Helped
Use a smaller phase multiplier for θ (ablation)LeapsAndBounds · Execution environment that allows resumingtotal runtimeHelped
Use a smaller phase multiplier for θ (ablation)LeapsAndBounds · Execution environment without resumetotal runtimeHurt

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