Research map / Learning theory and algorithms / Combinatorial and search optimization
Optimistic Tree Searches for Combinatorial Black-Box Optimization
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
- Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback (AAAI 2022 · similarity 0.89)
- Adaptive Partitioning Schemes for Optimistic Optimization (ICML 2025 · similarity 0.87)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · similarity 0.87)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.87)
- Scenario-Based Robust Optimization of Tree Structures (AAAI 2025 · similarity 0.86)
- NN-Steiner: A Mixed Neural-Algorithmic Approach for the Rectilinear Steiner Minimum Tree Problem (AAAI 2024 · similarity 0.85)
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.