AI Paper Atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Failure-Aware Gaussian Process Optimization with Regret Bounds

Shogo Iwazaki, Shion Takeno, Tomohiko Tanabe, Mitsuru Irie

NeurIPS 2023 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Gaussian process bandit regret · 2 citations (OpenAlex)

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 changedWhereMeasuredEffect
use F-GP-UCB instead of EI and GP-UCB that ignore failuresGP optimization · Branin with failure regionsregretImproved
use F-GP-UCB instead of GPC-based EFI-GPC-EP/SignGP optimization · Branin with failure regionsregretImproved
use F-GP-UCB instead of baselinesGP optimization · Gardner (2D constrained)regretImproved
use F-GP-UCB instead of EFI-GPC-SignGP optimization · Hartmann 3D hypersphereregretHurt
use F-GP-UCB instead of classic GPC (EFI-GPC-EP)GP optimization · Hartmann 3D hypersphereregretImproved
use F-GP-UCB instead of baselinesGP optimization · Quasicrystal simulation (Al-Cu-Mn)regretImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy