Research map / Bandits and online learning / Multi-armed bandits
Instance-optimal PAC Algorithms for Contextual Bandits
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
- PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits (ICML 2019 · similarity 0.92)
- On Minimizing Regret in Fixed-Confidence $\varepsilon$-Best Arm Identification (NeurIPS 2026 · similarity 0.91)
- Adaptive Multiple-Arm Identification (ICML 2017 · similarity 0.91)
- Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits (NeurIPS 2024 · similarity 0.90)
- From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards (NeurIPS 2025 · similarity 0.89)
- Best Arm Identification for Stochastic Rising Bandits (ICML 2024 · 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.