AI Paper Atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Bandit Phase Retrieval

Tor Lattimore, Botao Hao

NeurIPS 2021 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Linear and generalized linear bandits · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use the paper's algorithm instead of the best prior algorithmbandit phase retrieval algorithm · bandit phase retrieval (theoretical bound)regret upper boundImproved
Apply the algorithm to pure exploration instead of regret minimisationbandit phase retrieval algorithm · pure exploration (theoretical bound)simple regret upper boundImproved
Match the new upper bound with a lower bound specific to bandit phase retrievallower bound analysis · bandit phase retrieval (theoretical bound)regret lower boundImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy