atlas

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

On Approximate Thompson Sampling with Langevin Algorithms

ICML 2020 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Thompson sampling analysis · 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
Warm-start Langevin sampler from previous round's sample (instead of re-initializing from prior)ULA / SGLD approximate Thompson sampling · multi-armed bandit regretnumber of Langevin iterations N neededHelped
Scale posterior by gamma_a = 1/(8 d_a kappa_a^3) (posterior scaling for exploration)exact Thompson sampling · multi-armed bandit regretexpected regret boundHelped
Subsampled stochastic gradients (SGLD) with constant batch size and constant iterations instead of full-gradient ULAapproximate Thompson sampling · multi-armed bandit regretper-round computational costHelped
Decrease approximation error of posterior sample over time (TV error of order 1/n) versus constant errorThompson sampling with approximate posterior samples · Gaussian two-arm counterexamplecumulative regretMixed

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