AI Paper Atlas

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

Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior

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

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 changedWhereMeasuredEffect
Estimate the GP prior from offline functions and use the estimated prior for BOPEM-BO · Continuous synthetic functionbest function value after 10 evaluationsNo clear effect
Estimate the GP prior from offline functions rather than use a fixed squared exponential kernelPEM-BO · Grasp optimizationbest function valueHelped
Estimate the GP prior from offline functions rather than use fixed kernels on the original parameter spacesPEM-BO · Grasp, base pose, and placement optimizationbest function valueHelped
Use fixed squared exponential kernel assumptions instead of estimating the prior from offline dataPlain and TLSM-BO · Grasp, base pose, and placement optimizationbest function valueHurt
Limit the training data available to TLSM-BOTLSM-BO · Continuous synthetic functionbest function valueHurt

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