Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Online Learning to Rank with Top-k Feedback
Sougata Chaudhuri, Ambuj Tewari
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Adaptively Learning to Select-Rank in Online Platforms (ICML 2024 · similarity 0.87)
- Sampling for Beyond-Worst-Case Online Ranking (AAAI 2024 · similarity 0.86)
- Online Learning with Sublinear Best-Action Queries (NeurIPS 2024 · similarity 0.85)
- On the Convergence of No-Regret Dynamics in Information Retrieval Games with Proportional Ranking Functions (ICLR 2025 · similarity 0.85)
- An Analysis of Elo Rating Systems via Markov Chains (NeurIPS 2024 · similarity 0.85)
- Online Set Learning from Precision and Recall Feedback (NeurIPS 2026 · similarity 0.84)
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.
