atlas

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

Fighting Boredom in Recommender Systems with Linear Reinforcement Learning

NeurIPS 2018 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Causal and structured bandits · 20 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
plan a long-term cycle of actions (LINUCRL) instead of a greedy contextual policyLINUCRL · A/B testing simulatorrelative improvement over only A: 61.3% -> 66.7%Helped
exploit linear reward structure (LINUCRL) instead of tabular UCRLLINUCRL · MovieLens-100k simulatoraverage reward: 3.327 -> 3.54Helped
model recency effect and optimize long-term reward (LINUCRL) instead of LINUCBLINUCRL · MovieLens-100k simulatoraverage reward: 3.43 -> 3.54Helped
increase polynomial degree of recency reward model (ablation)recency reward model · MovieLens-100k reward fitR2: 0.55 -> 0.81 (action, d=1 to d=5)Helped
optimal long-term policy instead of greedy policy when boredom effect is strongtoy two-action MDP · toy experimentaverage rewardHelped
UCRL on A/B simulator versus only B baselineUCRL · A/B testing simulatorrelative improvement over only A: 46.0% -> 46.5%No clear effect

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