Almost optimal exploration in multi-armed bandits

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 2275-2283

  Karnin, Zohar ^a   Koren, Tomer ^b   Somekh, Oren ^a  

^a YAHOO RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

LARGE-SCALE APPLICATIONS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MULTI ARMED BANDIT; PROBLEM PARAMETERS; UPPER BOUND;

ALGORITHMS;

EID: 84897478950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Agarwal, D., Chen, B., and Elango, P. Explore/exploit schemes for web content optimization. In Proc. Ninth IEEE International Conference on Data Mining (ICDM'2009), pp. 1-10, 2009.
2. Audibert, J.Y., Bubeck, S., and Munos, R. Best arm identification in multi-armed bandits. In COLT, pp. 41-53, 2010.
3. Auer, P. and Ortner, R. UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem. Periodica Mathematica Hungarica, 61(1-2):55-65, 2010.
4. Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47(2):235-256, 2002. (Pubitemid 34126111)
5. Bubeck, S., Munos, R., and Stoltz, G. Pure exploration in multi-armed bandits problems. In Algorithmic Learning Theory, pp. 23-37. Springer, 2009.
6. Bubeck, S., Wang, T., and Viswanathan, N. Multiple identifications in multi-armed bandits. In Proceedings of the 30th International Conference on Machine Learning, 2013.
7. Chakrabarti, D., Kumar, R., Radlinski, F., and Upfal, E. Mortal multi-armed bandits. In Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NIPS'2008), pp. 273-280, 2008.
8. Even-Dar, E., Mannor, S., and Mansour, Y. PAC bounds for multi-armed bandit and markov decision processes. In COLT, pp. 193-209. Springer, 2002.
9. Even-Dar, E., Mannor, S., and Mansour, Y. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. The Journal of Machine Learning Research, 7:1079-1105, 2006. (Pubitemid 43938989)
10. Gabillon, V., Ghavamzadeh, M., Lazaric, A., and Bubeck, S. Multi-bandit best arm identification. In Advances in Neural Information Processing Systems 24, pp. 2222-2230. 2011.
11. Gabillon, V., Ghavamzadeh, M., and Lazaric, A. Best arm identification: A unified approach to fixed budget and fixed confidence. In Advances in Neural Information Processing Systems 25, pp. 3221-3229, 2012.
12. Kalyanakrishnan, S. and Stone, P. Efficient selection of multiple bandit arms: Theory and practice. In Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 511-518, 2010.
13. Kalyanakrishnan, S., Tewari, A., Auer, P., and Stone, P. PAC subset selection in stochastic multi-armed bandits. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012, 2012.
14. Lai, Tze Leung and Robbins, Herbert. Asymptotically efficient adaptive allocation rules. Advances in applied mathematics, 6(1):4-22, 1985.
15. Mannor, S. and Tsitsiklis, J.N. The sample complexity of exploration in the multi-armed bandit problem. The Journal of Machine Learning Research, 5:623-648, 2004.
16. Pandey, S., Agarwal, D., Chakrabarti, D., and Josifovski, V. Bandits for taxonomies: A model based approach. In In Proceedings of the SIAM International Conference on Data Mining. SDM, 2007.
17. Radlinski, F., Kleinberg, R., and Joachims, T. Learning diverse rankings with multi-armed bandits. In Proceedings of the 25th International Conference on Machine Learning, pp. 784-791. ACM, 2008.