Kullback-Leibler upper confidence bounds for optimal sequential allocation

Audibert, Jean-YvesJ.-Y., Munos, RémiR. andSzepesvári, CsabaC. (2009). Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoret. Comput. Sci. 410 1876–1902

1902

Earlier work this paper cites.

Thompson, W. R.W. R. (1933). On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25 285–294

1933

Earlier work this paper cites.

Thompson, William R.W. R. (1935). On the Theory of Apportionment. Amer. J. Math. 57 450–456

1935

Earlier work this paper cites.

Wald, A.A. (1945). Sequential tests of statistical hypotheses. Ann. Math. Statist. 16 117–186

1945

Earlier work this paper cites.

Robbins, HerbertH. (1952). Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. (N.S.) 58 527–535

1952

Earlier work this paper cites.

Hoeffding, WassilyW. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13–30

1963

Earlier work this paper cites.

Gittins, J. C.J. C. (1979). Bandit processes and dynamic allocation indices (with discussion). J. R. Stat. Soc. Ser. B Stat. Methodol. 41 148–177

1979

Earlier work this paper cites.

Whittle, P.P. (1980). Multi-armed bandits and the Gittins index. J. R. Stat. Soc. Ser. B Stat. Methodol. 42 143–149

Original

1980

Earlier work this paper cites.

Lai, T. L.T. L. andRobbins, HerbertH. (1985). Asymptotically efficient adaptive allocation rules. Adv. in Appl. Math. 6 4–22

1985

Earlier work this paper cites.

Chang, FuF. andLai, Tze LeungT. L. (1987). Optimal stopping and dynamic allocation. Adv. in Appl. Probab. 19 829–853

1987

Earlier work this paper cites.

Chow, Yuan ShihY. S. andTeicher, HenryH. (1988). Probability Theory: Independence, Interchangeability, Martingales, 2nd ed. Springer, New York

1988

Earlier work this paper cites.

Weber, RichardR. (1992). On the Gittins index for multiarmed bandits. Ann. Appl. Probab. 2 1024–1033

1992

Earlier work this paper cites.

Agrawal, RajeevR. (1995). Sample mean based index policies with O ⁡ ( log ⁡ n ) O(\log n) regret for the multi-armed bandit problem. Adv. in Appl. Probab. 27 1054–1078

1995

Cited alongside, same era.

Burnetas, Apostolos N.A. N. andKatehakis, Michael N.M. N. (1996). Optimal adaptive policies for sequential allocation problems. Adv. in Appl. Math. 17 122–142

1996

Cited alongside, same era.

Burnetas, Apostolos N.A. N. andKatehakis, Michael N.M. N. (1997). Optimal adaptive policies for Markov decision processes. Math. Oper. Res. 22 222–255

1997

Cited alongside, same era.

Dembo, AmirA. andZeitouni, OferO. (1998). Large Deviations Techniques and Applications, 2nd ed. Applications of Mathematics (New York) 38. Springer, New York

1998

Cited alongside, same era.

Lehmann, E. L.E. L. andCasella, GeorgeG. (1998). Theory of Point Estimation, 2nd ed. Springer, New York

Filippi, S.S., Cappé, O.O. andGarivier, A.A. (2010). Optimism in reinforcement learning and Kullback–Leibler divergence. In Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing. IEEE Press, Piscataway, NJ

2010

Later among the works it cites.

Honda, J.J. andTakemura, A.A. (2010). An asymptotically optimal bandit algorithm for bounded support models. In Proceedings of the 23rd Annual Conference on Learning Theory. Omnipress, Madison, WI

2010

Later among the works it cites.

Garivier, A.A. andCappé, O.O. (2011). The KL-UCB algorithm for bounded stochastic bandits and beyond. In Proceedings of the 24th Annual Conference on Learning Theory. JMLR C&WP

2011

Later among the works it cites.

Gittins, J.J., Glazebrook, K.K. andWeber, R.R. (2011). Multi-Armed Bandit Allocation Indices. Wiley, New York

2011

Later among the works it cites.