Research map / Probabilistic and scientific modeling / Bayesian optimization
Batched Gaussian Process Bandit Optimization via Determinantal Point Processes
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 |
|---|---|---|---|
| Sample batches via DPP-SAMPLE instead of greedy DPP-MAX | UCB/EST-DPP · Branin-Hoo and Hartmann-6, B=5 and 10 | immediate regret | Helped |
| Use DPP-MAX instead of batched BUCB/B-EST | UCB/EST-DPP-MAX · robot | immediate regret | Helped |
| Increase batch size from 5 to 10 for DPP-SAMPLE vs DPP-MAX | DPP-SAMPLE · robot | immediate regret | Helped |
| Use LP-UCB instead of UCB-DPP-SAMPLE | LP-UCB · robot | immediate regret | Hurt |
| Use LP-UCB instead of DPP-MAX | LP-UCB · Hartmann-6 | immediate regret | Helped |
| Use DPP-SAMPLE instead of LP-UCB | DPP-SAMPLE · Hartmann-6 | immediate regret | Helped |
| Increase batch size from 5 to 10 | LP-UCB · Branin-Hoo | immediate regret | No clear effect |
| Use DPP methods instead of batched counterparts | DPP-MAX and DPP-SAMPLE · FastXML Bibtex Prec@1 | immediate regret | Helped |
| Use DPP-SAMPLE instead of DPP-MAX, B=5 | DPP-SAMPLE · FastXML Bibtex Prec@1 | immediate regret | Mixed |
| Use LP-UCB instead of UCB-DPP-MAX, B=10 | LP-UCB · FastXML Bibtex Prec@1 | immediate regret | Helped |
| Use DPP-SAMPLE instead of LP-UCB | DPP-SAMPLE · Abalone | immediate regret | Helped |
| Use LP-UCB, B=5 vs B=10 | LP-UCB · FastXML Delicious | immediate regret | Mixed |
Closest papers by meaning
- Improved Regret Analysis For Parallel Gaussian Process Bandit Optimization (NeurIPS 2026 · similarity 0.91)
- Near-linear time Gaussian process optimization with adaptive batching and resparsification (ICML 2020 · similarity 0.90)
- Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance (ICML 2025 · similarity 0.88)
- Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits (NeurIPS 2025 · similarity 0.88)
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.87)
- Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization (NeurIPS 2025 · similarity 0.87)
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.