Research map / Bandits and online learning / Contextual bandits and Thompson sampling
A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance
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 |
|---|---|---|---|
| GP-ThreDS domain-shrinking instead of IGP-UCB, AD, EI and PI | GP-ThreDS · Branin and Rosenbrock, SE kernel | average per-sample regret vs wall-clock time | Helped |
| GP-ThreDS versus other BO algorithms in computation cost | GP-ThreDS · Branin and Rosenbrock, 1000 samples | computation time (seconds) | Helped |
Closest papers by meaning
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.91)
- Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds (ICML 2024 · similarity 0.88)
- Principled Preferential Bayesian Optimization (ICML 2024 · similarity 0.87)
- Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood (NeurIPS 2024 · similarity 0.87)
- Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization (NeurIPS 2025 · similarity 0.87)
- Optimizing Posterior Samples for Bayesian Optimization via Rootfinding (ICLR 2025 · similarity 0.86)
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.