atlas

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

UniRank: Unimodal Bandit Algorithms for Online Ranking

ICML 2022 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Ranking bandits · 0 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 UniRank instead of TopRankOnline ranking · Yandex query 8107157, Simul PBM, and Simul CMcumulative regretHelped
Use UniRank instead of TopRankOnline ranking · Other tested modelscumulative regretMixed
Use UniRank rather than a method requiring a known horizonOnline ranking · Tested click-model settingscumulative regretHelped
Use CascadeKL-UCB rather than generic algorithmsOnline ranking · Cascading modelcumulative regretHelped
Use PB-MHB rather than generic algorithmsOnline ranking · Position Based Modelcumulative regretHelped
Use GRAB on Yandex query 8107157 or Simul PBMOnline ranking · Yandex query 8107157 and Simul PBMcumulative regretHurt
Use PB-MHB instead of UniRankOnline ranking · Yandex top 10 queries, CM, L=10computation time per recommendation: 1.0\pm0.2 -> 13.9 \pm 4.9Hurt

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