atlas

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

A Bayesian Approach for Subset Selection in Contextual Bandits

AAAI 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 0 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 BRE's posterior resampling and context-aware action selection instead of LinGapELinear bandit best-arm identification · Synthetic data 1 and 2; Yahoo linear datanumber of samplesHelped
Use posterior resampling and context-aware selection rather than BayesGapLinear bandit best-arm identification · Synthetic data 1number of samplesHelped
Use a frequentist stopping rule instead of the BRE Monte Carlo stopping ruleBayesGap · Synthetic data 2number of samplesHurt
Use BRE for Explore-K subset selectionExplore-K contextual bandits · Yahoo Webscope Dataset R6A simulated Explore-Knumber of samplesHelped

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