Research map / Learning theory and algorithms / Combinatorial and search optimization
ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool
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.
Closest papers by meaning
- LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration (ICML 2018 · similarity 0.90)
- Utilitarian Algorithm Configuration for Infinite Parameter Spaces (ICLR 2025 · similarity 0.86)
- On the Universal Near Optimality of Hedge in Combinatorial Settings (NeurIPS 2025 · similarity 0.85)
- Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances (ICLR 2024 · similarity 0.85)
- Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis (AAAI 2025 · similarity 0.85)
- Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces (AAAI 2025 · similarity 0.84)
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.