AI Paper Atlas

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

Information Directed Sampling for Sparse Linear Bandits

Botao Hao, Tor Lattimore, Wei Deng

NeurIPS 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Thompson sampling analysis · 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
use sparse IDS instead of sparse TSsparse linear bandit · Hard sparse linear bandit instance, d=10, s=2cumulative Bayesian regretImproved
use sparse IDS instead of LinUCB, LinTS, IDS and ESTCsparse linear bandit · Multivariate Gaussian action set, d=20, 40, 100, K=200cumulative Bayesian regretImproved
use sparsity-aware ESTC instead of non-sparse algorithmslinear bandit baselines · Multivariate Gaussian action setcumulative 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