Research map / Bandits and online learning / Multi-armed bandits
Optimal Top-$k$ Identification from Pairwise Comparisons
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.
Closest papers by meaning
- Balancing Performance and Costs in Best Arm Identification (NeurIPS 2025 · similarity 0.88)
- Near Optimal Non-asymptotic Sample Complexity of 1-Identification (ICML 2025 · similarity 0.88)
- Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits (NeurIPS 2026 · similarity 0.88)
- Fixed Confidence Best Arm Identification in the Bayesian Setting (NeurIPS 2024 · similarity 0.87)
- Optimal Multi-Fidelity Best-Arm Identification (NeurIPS 2024 · similarity 0.87)
- Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization (ICML 2024 · similarity 0.86)
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.