Bandits with heavy tail

Some aspects of the sequential design of experiments

Original

H. Robbins · 1952

Earlier work this paper cites.

Robust estimation of a location parameter

P. J. Huber · 1964

Earlier work this paper cites.

On some robust estimates of location

P. J. Bickel · 1965

Earlier work this paper cites.

Robust Statistics

P. J. Huber · 1981

Earlier work this paper cites.

Asymptotically efficient adaptive allocation rules

T. L. Lai and H. Robbins · 1985

Earlier work this paper cites.

Sample mean based index policies with O ⁡ ( log ⁡ n ) {O}(\log n) regret for the multi-armed bandit problem

R. Agrawal · 1995

Earlier work this paper cites.

The racing algorithm: Model selection for lazy learners

O. Maron and A.W. Moore · 1997

Cited alongside, same era.

An optimal algorithm for monte carlo estimation

P. Dagum, R. Karp, M. Luby, and S. Ross · 2000

Cited alongside, same era.

The space complexity of approximating the frequency moments

N. Alon, Y. Matias, and M. Szegedy · 2002

Cited alongside, same era.

Finite-time analysis of the multiarmed bandit problem

P. Auer, N. Cesa-Bianchi, and P. Fischer · 2002

Cited alongside, same era.

Adaptive sampling methods for scaling up knowledge discovery algorithms

C. Domingo, R. Gavaldà, and O. Watanabe · 2002

Cited alongside, same era.

Bandits Games and Clustering Foundations

S. Bubeck · 2010

Later among the works it cites.

Challenging the empirical mean and empirical variance: a deviation study

Original

O. Catoni · 2010

Later among the works it cites.

The KL-UCB algorithm for bounded stochastic bandits and beyond

A. Garivier and O. Cappé · 2011

Later among the works it cites.

Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems

K. Liu and Q. Zhao · 2011

Later among the works it cites.

Regret analysis of stochastic and nonstochastic multi-armed bandit problems

Original

S. Bubeck and N. Cesa-Bianchi · 2012

Closest in time.