Research map / Learning theory and algorithms / Combinatorial and search optimization
CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Replace Structured Procrastination/LeapsAndBounds with CapsAndRuns (estimate per-config caps, then Bernstein race) | algorithm configuration of minisat · minisat SAT configuration (CNFuzzDD) | total CPU time (days): 586 vs 1451 days for LeapsAndBounds, 20643 for Structured Procrastination | Helped |
| Use CapsAndRuns instead of LeapsAndBounds across (epsilon, delta) settings | algorithm configuration of minisat · epsilon in 0.02-0.10, delta in 0.02-0.10 | ratio of total runtime LeapsAndBounds / CapsAndRuns | Helped |
Closest papers by meaning
- LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration (ICML 2018 · similarity 0.92)
- Iterative Methods via Locally Evolving Set Process (NeurIPS 2024 · similarity 0.84)
- Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis (AAAI 2025 · similarity 0.83)
- PEARL: Solver-in-the-Loop Interactive Optimization Modeling from Natural Language (NeurIPS 2026 · similarity 0.83)
- OptiBench Meets ReSocratic: Measure and Improve LLMs for Optimization Modeling (ICLR 2025 · similarity 0.83)
- Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances (ICLR 2024 · similarity 0.83)
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.