DeepAI AI Chat
Log In Sign Up

Fixed-Confidence Guarantees for Bayesian Best-Arm Identification

by   Xuedong Shang, et al.

We investigate and provide new insights on the sampling rule called Top-Two Thompson Sampling (TTTS). In particular, we justify its use for fixed-confidence best-arm identification. We further propose a variant of TTTS called Top-Two Transportation Cost (T3C), which disposes of the computational burden of TTTS. As our main contribution, we provide the first sample complexity analysis of TTTS and T3C when coupled with a very natural Bayesian stopping rule, for bandits with Gaussian rewards, solving one of the open questions raised by Russo (2016). We also provide new posterior convergence results for TTTS under two models that are commonly used in practice: bandits with Gaussian and Bernoulli rewards and conjugate priors.


page 1

page 2

page 3

page 4


Optimal Best Arm Identification with Fixed Confidence

We give a complete characterization of the complexity of best-arm identi...

Dealing with Unknown Variances in Best-Arm Identification

The problem of identifying the best arm among a collection of items havi...

A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits

We propose a new strategy for best-arm identification with fixed confide...

Optimality Conditions and Algorithms for Top-K Arm Identification

We consider the top-k arm identification problem for multi-armed bandits...

On the Complexity of A/B Testing

A/B testing refers to the task of determining the best option among two ...

Selective Sampling for Online Best-arm Identification

This work considers the problem of selective-sampling for best-arm ident...

The bias of the sample mean in multi-armed bandits can be positive or negative

It is well known that in stochastic multi-armed bandits (MAB), the sampl...