Research map / Bandits and online learning / Multi-armed bandits
Fast Pure Exploration via Frank-Wolfe
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
- The Batch Complexity of Bandit Pure Exploration (ICML 2025 · similarity 0.91)
- FraPPE: Fast and Efficient Preference-Based Pure Exploration (NeurIPS 2025 · similarity 0.89)
- Near Optimal Non-asymptotic Sample Complexity of 1-Identification (ICML 2025 · similarity 0.89)
- Instance-Optimal Pure Exploration for Linear Bandits on Continuous Arms (ICML 2025 · similarity 0.89)
- Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap (AAAI 2025 · similarity 0.89)
- Infrequent Exploration in Linear Bandits (NeurIPS 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.