atlas

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

Online Learning to Rank in Stochastic Click Models

ICML 2017 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Ranking bandits · 55 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 BatchRank instead of RankedExp3Online learning to rank on Yandex queries · CM and PBMexpected per-step regretHelped
Use CascadeKL-UCB instead of BatchRankOnline learning to rank · CMexpected per-step regretHelped
Use BatchRank instead of CascadeKL-UCBOnline learning to rank · PBM at T = 2M stepsexpected per-step regretHelped
Apply CascadeKL-UCB outside its intended cascade modelCascadeKL-UCB · PBMexpected per-step regretHurt
Use KL confidence intervals rather than UCB1 confidence intervals (ablation)BatchRank · Stochastic click banditscumulative regret: O((α* - α)^-1) vs. O(χ^-1 (α* - α)^-1)Helped
Remove item elimination from UpdateBatch (ablation)BatchRank · Stochastic click banditsregret dependence on number of items L: quadratic in LHurt

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