atlas

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

Scalable Generalized Linear Bandits: Online Computation and Hashing

NeurIPS 2017 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Linear and generalized linear bandits · 60 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 GLOC instead of UCB-GLM or OL2MGLB algorithms · Logit modelcumulative regretNo clear effect
Use OL2M, which is designed for the logit model, on probit rewardsGLB algorithms · Probit modelcumulative regretHurt
Use hashing to evaluate the arm-selection objective on 1% of the armsQGLOC · Logit model, N=100,000, T=5000cumulative regretHurt
Use hashing to evaluate the arm-selection objective on 1% of the armsGLOC-TS · Logit model, N=100,000, T=5000cumulative regretHurt
Use L1 sampling instead of L2 samplingApproximate inner product estimation · Gaussian query and projection vectors, d=200variance: 0.99 to 0.63Helped
Use L1 sampling instead of L2 samplingApproximate inner product estimation · 1000-dimensional vectors, m=5estimation-error tail thicknessHelped

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