AI Paper Atlas

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

Online Learning in Contextual Bandits using Gated Linear Networks

Eren Sezener, Marcus Hutter, David Budden, Jianan Wang, Joel Veness

NeurIPS 2020 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 6 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
GLCB (online) vs nine batch-trained bandit baselinesGLCB · seven bandit tasksmean rank: 3.00 -> 2.29Improved
GLCB vs BootRMS on covertypeGLCB · covertypecumulative reward: 3002 -> 2825Hurt
GLCB vs BBAlphaDiv on adultGLCB · adultcumulative reward: 18 -> 742Improved
GLCB vs LinFullPost on wheelGLCB · wheelcumulative reward: 4491 -> 4308Hurt
GLCB vs BootRMS on wheelGLCB · wheelcumulative reward: 1933 -> 4308Improved
GLCB vs best baseline on statlogGLCB · statlogcumulative reward: 4762 -> 4814Improved
GLCB vs best baseline on censusGLCB · censuscumulative reward: 2693 -> 2804Improved
binarize financial regression reward so best action gets 1 and rest 0GLCB · financialrelative performanceImproved
continuous reward tasks instead of binary reward tasksGLCB · financial, jester, wheelrankHurt

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