Research map / Bandits and online learning / Online convex optimization and games
Dueling Bandits with Team Comparisons
Lee Cohen, Ulrike Schmidt-Kraepelin, Yishay Mansour
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
- The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits (NeurIPS 2026 · similarity 0.91)
- On Weak Regret Analysis for Dueling Bandits (NeurIPS 2024 · similarity 0.90)
- Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits (ICLR 2024 · similarity 0.89)
- Borda Regret Minimization for Generalized Linear Dueling Bandits (ICML 2024 · similarity 0.88)
- Fusing Reward and Dueling Feedback in Stochastic Bandits (ICML 2025 · similarity 0.88)
- Neural Dueling Bandits: Preference-Based Optimization with Human Feedback (ICLR 2025 · similarity 0.88)
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.
