Research map / Bandits and online learning / Multi-armed bandits
Gaussian Process Bandits with Aggregated Feedback
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 GPOO instead of StoOO or GPTree | Continuum-armed bandit optimization with single-point and average feedback · Two simulated reward functions | aggregated regret | Helped |
| Use GP predictions and their correlations rather than empirical means for node selection | GPOO compared with StoOO-based algorithms · Two simulated reward functions | aggregated regret | Helped |
| Increase the exploration parameter over rounds as β_t grows like O(log t), rather than using a budget-only parameter | GPOO compared with GPTree · Two simulated reward functions | aggregated regret | Helped |
Closest papers by meaning
- Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits (NeurIPS 2025 · similarity 0.90)
- Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance (ICML 2025 · similarity 0.90)
- Gaussian Process Bandits for Top-k Recommendations (NeurIPS 2024 · similarity 0.89)
- Improved Regret Analysis For Parallel Gaussian Process Bandit Optimization (NeurIPS 2026 · similarity 0.89)
- Bayesian Analysis of Combinatorial Gaussian Process Bandits (ICLR 2025 · similarity 0.88)
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · 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.