atlas

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

TopRank: A practical algorithm for online stochastic ranking

NeurIPS 2018 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Ranking bandits · 33 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 TopRank instead of BatchRankOnline ranking on the Yandex query simulations · Cascade modelregret: about three times lowerHelped
Use CascadeKL-UCB instead of TopRankOnline ranking on the Yandex query simulations · Cascade modelregret: about three times lowerHelped
Use TopRank instead of BatchRankOnline ranking on the Yandex query simulations · Position-based modelregret: about 30% lowerHelped
Use TopRank instead of CascadeKL-UCBOnline ranking on the Yandex query simulations · Position-based model, after 4 million stepsregret: after 4 million stepsHelped
Use CascadeKL-UCB instead of TopRankOnline ranking on the Yandex query simulations · Cascade modelregretHelped
Use TopRank instead of CascadeKL-UCBOnline ranking on the Yandex query simulations · Position-based model, across queriesregret: about two thirds of queriesMixed

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