Research map / Probabilistic and scientific modeling / Bayesian optimization
Bayesian Optimization with Unknown Search Space
Huong Ha, Santu Rana, Sunil Gupta, Thanh Nguyen, Hung Tran-The, Svetha Venkatesh
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization with an unknown search space · Beale, Eggholder, Levy3, Hartman3, and Hartman6 | best found objective value | Improved |
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization · Hartman3 and Hartman6 | best found objective value | Improved |
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization · Beale, Eggholder, and Levy3 | best found objective value | No clear effect |
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization for Elastic Net · MNIST | prediction accuracy | No clear effect |
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization for MLP · MNIST | prediction accuracy | Improved |
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization for MLP · MNIST | iterations to 97.8% prediction accuracy: 12 iterations; other approaches take more than 24 iterations | Improved |
| Use automatic, analytically determined search-space expansions with GPU-UCB | Bayesian optimization for CNN · MNIST | prediction accuracy: 98.7% | Improved |
| Use analytically derived expansion regions instead of numerically constructing them | GPUCB-UBO · Beale, Eggholder, Hartman3, Levy3, and Hartman6 | runtime (seconds): GPUCB-FBO is 2-3 times slower | Improved |
Closest papers by meaning
- FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch (ICML 2025 · similarity 0.89)
- BONSAI: Bayesian Optimization with Natural Simplicity and Interpretability (NeurIPS 2026 · similarity 0.89)
- Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal (NeurIPS 2024 · similarity 0.89)
- A General Framework for User-Guided Bayesian Optimization (ICLR 2024 · similarity 0.88)
- Understanding High-Dimensional Bayesian Optimization (ICML 2025 · similarity 0.88)
- Stopping Bayesian Optimization with Probabilistic Regret Bounds (NeurIPS 2024 · similarity 0.88)
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.
