Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Gaussian Process Bandit Optimisation with Multi-fidelity Evaluations
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 |
|---|---|---|---|
| Use cheap low-fidelity approximations (MF-GP-UCB) instead of only the expensive function | MF-GP-UCB · Synthetic and real hyper-parameter tuning tasks | simple regret / CV error / CPU time | Helped |
| Replace multi-fidelity method with naive strategy (GP-UCB at low fidelity then high fidelity at its points) | MF-NAIVE · Synthetic and real experiments | simple regret | Hurt |
| Use MF-SKO multi-fidelity baseline instead of MF-GP-UCB | MF-SKO · Synthetic experiments | simple regret | Hurt |
Closest papers by meaning
- Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits (NeurIPS 2025 · similarity 0.89)
- Improved Regret Analysis For Parallel Gaussian Process Bandit Optimization (NeurIPS 2026 · similarity 0.88)
- Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance (ICML 2025 · similarity 0.88)
- Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization (NeurIPS 2025 · similarity 0.86)
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.86)
- Bayesian Analysis of Combinatorial Gaussian Process Bandits (ICLR 2025 · 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.