From the archives

On Explore-Then-Commit Strategies

Historical material. Affiliations, schedules and roles on this page describe their original context.

ConferenceName:  Neural Information Processing Systems

url:  NIPS 2016

Edition Number:  30

Date:  December, 2016

Place:  Barcelona, Spain

Authors:  Aurélien GarivierEmilie KaufmannTor Lattimore

Abstract: 

We study the problem of minimising regret in two-armed bandit problems with Gaussian rewards. Our objective is to use this simple setting to illustrate that strategies based on an exploration phase (up to a stopping time) followed by exploitation are necessarily suboptimal. The results hold regardless of whether or not the difference in means between the two arms is known. Besides the main message, we also refine existing deviation inequalities, which allow us to design fully sequential strategies with finite-time regret guarantees that are (a) asymptotically optimal as the horizon grows and (b) order-optimal in the minimax sense. Furthermore we provide empirical evidence that the theory also holds in practice and discuss extensions to non-gaussian and multiple-armed case.
NIPS trailer

Arxiv Number:  1605.08988

Hal Number:  01322906

Keywords: