AI Paper Atlas

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

Provably Optimal Algorithms for Generalized Linear Contextual Bandits

ICML 2017 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 144 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 SupCB-GLM with stage-wise confidence filtering and independent sample setsGLM contextual bandits with fixed K · GLM contextual bandits, fixed Kexpected regret: Õ(d√T) -> O((log T)^1.5 √(dT log K))Helped
Use UCB-GLM with a confidence bonusGLM contextual bandits · GLM contextual banditsexpected regret: Õ(d√T)Helped
Assume the cumulative inverse square-root minimum eigenvalue is bounded by c√TUCB-GLM · GLM contextual bandits under the stated eigenvalue conditionregret upper bound: Õ(d√T) -> (C Lμ σ/κ) √(dT log(T/δ))Helped
Use directional finite-sample confidence for the MLE instead of bounding only its parameter error in ℓ2SupCB-GLM regret analysis · GLM contextual bandits, fixed Kregret upper bound: removes an extra √d factorHelped

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