Sparse Dueling Bandits

The sample complexity of exploration in the multi-armed bandit problem

Mannor, S. and Tsitsiklis, J. N. (2004) · 2004

Earlier work this paper cites.

Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems

Even-Dar, E., Mannor, S., and Mansour, Y. (2006) · 2006

Earlier work this paper cites.

Letor: A benchmark collection for research on learning to rank for information retrieval

Qin, T., Liu, T.-Y., Xu, J., and Li, H. (2010) · 2010

Earlier work this paper cites.

Beat the mean bandit

Yue, Y. and Joachims, T. (2011) · 2011

Earlier work this paper cites.

The k-armed dueling bandits problem

Yue, Y., Broder, J., Kleinberg, R., and Joachims, T. (2012) · 2012

Earlier work this paper cites.

Concentration inequalities: A nonasymptotic theory of independence

Boucheron, S., Lugosi, G., and Massart, P. (2013) · 2013

Cited alongside, same era.

Almost optimal exploration in multi-armed bandits

Karnin, Z., Koren, T., and Somekh, O. (2013) · 2013

Cited alongside, same era.

Introducing letor 4.0 datasets

Original

Qin, T. and Liu, T.-Y. (2013) · 2013

Cited alongside, same era.

Generic exploration and k k -armed voting bandits

Urvoy, T., Clerot, F., Féraud, R., and Naamane, S. (2013) · 2013

Cited alongside, same era.

Reducing dueling bandits to cardinal bandits

Original

Ailon, N., Joachims, T., and Karnin, Z. (2014) · 2014

Later among the works it cites.

lil’ucb : An optimal exploration algorithm for multi-armed bandits

Jamieson, K., Malloy, M., Nowak, R., and Bubeck, S. (2014) · 2014

Later among the works it cites.

On the complexity of best arm identification in multi-armed bandit models

Original

Kaufmann, E., Cappé, O., and Garivier, A. (2014) · 2014

Later among the works it cites.

Relative upper confidence bound for the k-armed dueling bandit problem

Original

Zoghi, M., Whiteson, S., Munos, R., and de Rijke, M. (2013) · 2014

Later among the works it cites.