AI Paper Atlas

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

Scalable Thompson Sampling using Sparse Gaussian Process Models

Sattar Vakili, Henry Moss, Artem Artemev, Vincent Dutordoir, Victor Picheny

NeurIPS 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Gaussian process bandit regret · 3 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
Scale the covariance of decoupled samples by α_t² while leaving the mean unchangedS-GP-TS decoupled sampling · Sequential optimizationstrict regret guaranteeImproved
Use a larger additive error in the approximate posterior standard deviationApproximate GP-TS · Sequential optimizationstrict regret: (31β_T+α_T)εTHurt
Use too few prior features in the truncated feature representationS-GP-TS · Sequential optimizationstrict regret: ε_t = √(C_1m_tδ_M)Hurt
Use too few inducing variablesS-GP-TS with inducing features · Sequential optimizationstrict regret: κ_t = 2tδ_{m_t}/τHurt
Use random Fourier features as a finite-dimensional posterior approximationGP-TS · Points far from observationsposterior variance accuracyHurt

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