Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Bandit Phase Retrieval
Tor Lattimore, Botao Hao
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the paper's algorithm instead of the best prior algorithm | bandit phase retrieval algorithm · bandit phase retrieval (theoretical bound) | regret upper bound | Improved |
| Apply the algorithm to pure exploration instead of regret minimisation | bandit phase retrieval algorithm · pure exploration (theoretical bound) | simple regret upper bound | Improved |
| Match the new upper bound with a lower bound specific to bandit phase retrieval | lower bound analysis · bandit phase retrieval (theoretical bound) | regret lower bound | Improved |
Closest papers by meaning
- Finite-Time Logarithmic Bayes Regret Upper Bounds (NeurIPS 2023 · similarity 0.89)
- Prior Diffusiveness and Regret in the Linear-Gaussian Bandit (ICML 2026 · similarity 0.88)
- Improved Regret Bounds for Bandit Combinatorial Optimization (NeurIPS 2019 · similarity 0.88)
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · similarity 0.88)
- Regret minimization in Linear Bandits with offline data via extended D-optimal exploration. (NeurIPS 2026 · similarity 0.88)
- Nearly Minimax Optimal Submodular Maximization with Bandit Feedback (NeurIPS 2024 · similarity 0.87)
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.
