atlas

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

Universal and data-adaptive algorithms for model selection in linear contextual bandits

ICML 2022 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 1 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
Replace the ordinary inverse-covariance estimator with eigenvalue thresholdingModCB · MAB-vs-linear CB with arbitrary stochastic sub-Gaussian contextsmodel-selection rate exponent alpha: 1/3 -> 1/6Helped
Use data-adaptive exploration that checks whether the greedy arm's context preserves diversityModCB.A · MAB-vs-linear CB when every arm has feature diversitysimple-model regret: T^{2/3} -> \log(T)/\textrm{gap}Helped
Use data-adaptive exploration while retaining forced exploration when the diversity check failsModCB.A · MAB-vs-linear CB under arm-averaged feature diversitycontextual-model regret: d^{1/3}T^{2/3} -> d^{1/3}T^{2/3}No clear effect
Require arm-specific rather than only arm-averaged feature diversityOSOM · MAB-vs-linear CBmodel-selection guaranteeHurt

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