Thompson sampling: An asymptotically optimal finite-time analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7568 LNAI, Issue , 2012, Pages 199-213

  Kaufmann, Emilie ^a   Korda, Nathaniel ^b   Munos, Rémi ^b  

^a TELECOM PARISTECH   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC RATE; ASYMPTOTICALLY OPTIMAL; BERNOULLI; FINITE-TIME ANALYSIS; LOWER BOUNDS; MULTI-ARMED BANDIT PROBLEM; NUMERICAL COMPARISON; OPTIMAL POLICIES; OPTIMALITY; THOMPSON;

ARTIFICIAL INTELLIGENCE;

OPTIMIZATION;

EID: 84867888479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34106-9_18     Document Type: Conference Paper

References (14)

1. Agrawal, S., Goyal, N.: Analysis of thompson sampling for the multi-armed bandit problem. In: Conference on Learning Theory, COLT (2012)
2. Audibert, J.-Y., Bubeck, S.: Regret bounds and minimax policies under partial monitoring. Journal of Machine Learning Research 11, 2785-2836 (2010)
3. Audibert, J.-Y., Munos, R., Szepesvaŕi, C.: Exploration- exploitation trade-off using variance estimates in multi-armed bandits. Theoretical Computer Science 410(19), 1876-1902 (2009)
4. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47(2), 235-256 (2002)
5. Chapelle, O., Li, L.: An empirical evaluation of thompson sampling. In: NIPS (2011)
6. Garivier, A., Cappé, O.: The kl-ucb algorithm for bounded stochastic bandits and beyond. In: Conference on Learning Theory, COLT (2011)
7. Granmo, O.C.: Solving two-armed bernoulli bandit problems using a bayesian learning automaton. International Journal of Intelligent Computing and Cybernetics 3(2), 207-234 (2010)
8. Honda, J., Takemura, A.: An asymptotically optimal bandit algorithm for bounded support models. In: Conference on Learning Theory, COLT (2010)
9. Kaufmann, E., Garivier, A., Cappé, O.: On bayesian upper-confidence bounds for bandit problems. In: AISTATS (2012)
10. Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6(1), 4-22 (1985)
11. Maillard, O.-A., Munos, R., Stoltz, G.: A finite-time analysis of multi-armed bandits problems with kullback-leibler divergences. In: Conference on Learning Theory, COLT (2011)
12. May, B.C., Korda, N., Lee, A., Leslie, D.: Optimistic bayesian sampling in contextual bandit problems. Journal of Machine Learning Research 13, 2069-2106 (2012)
13. Salomon, A., Audibert, J.-Y.: Deviations of Stochastic Bandit Regret. In: Kivinen, J., Szepesvári, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 159-173. Springer, Heidelberg (2011)
14. Thompson,W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25, 285-294 (1933)