AI Paper Atlas

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

Bayesian Optimization under Heavy-tailed Payoffs

NeurIPS 2019 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Gaussian process bandit regret · 8 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
Use ATA-GP-UCB instead of TGP-UCBBayesian optimization under heavy-tailed rewards · Synthetic data, stock market data, and light sensor datatime-average regretHelped
Use Nyström approximation instead of QFF approximationATA-GP-UCB · Experiments where both approximations were evaluatedtime-average regretNo clear effect
Truncate large reward samples (ablation)GP-UCB · Synthetic experiment with sparse noise taking values in {-10, 10}estimation qualityHelped
Use untruncated rewards (ablation)GP-UCB · Synthetic experiment with sparse noise taking values in {-10, 10}estimation qualityHurt

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