Combinatorial pure exploration of multi-armed bandits

Advances in Neural Information Processing Systems

Volumn 1, Issue January, 2014, Pages 379-387

  Chen, Shouyuan ^a   Lin, Tian ^b   King, Irwin ^a   Lyu, Michael R ^a   Chen, Wei ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b TSINGHUA UNIVERSITY   (China)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

ANALYTIC TOOLS; COMBINATORIAL STRUCTURES; CONSTANT FACTORS; DECISION CLASS; EXPLORATION TASKS; MULTI ARMED BANDIT; OPTIMAL SAMPLES; SPANNING TREE;

INFORMATION SCIENCE;

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

References (31)

1. J.-Y. Audibert, S. Bubeck, and R. Munos. Best arm identification in multi-armed bandits. In COLT, 2010.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47(2-3):235-256, 2002.
3. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
4. C. Berge. Two theorems in graph theory. PNAS, 1957.
5. S. Bubeck and N. Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning, 5:1-122, 2012.
6. S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in finitely-armed and continuous-armed bandits. Theoretical Computer Science, 412:1832-1852, 2010.
7. S. Bubeck, N. Cesa-bianchi, S. M. Kakade, S. Mannor, N. Srebro, and R. C. Williamson. Towards minimax policies for online linear optimization with bandit feedback. In COLT, 2012.
8. S. Bubeck, T. Wang, and N. Viswanathan. Multiple identifications in multi-armed bandits. In ICML, pages 258-265, 2013.
9. N. Cesa-Bianchi and G. Lugosi. Combinatorial bandits. JCSS, 78(5):1404-1422, 2012.
10. W. Chen, Y. Wang, and Y. Yuan. Combinatorial multi-armed bandit: General framework and applications. In ICML, pages 151-159, 2013.
11. E. Even-Dar, S. Mannor, and Y. Mansour. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. JMLR, 2006.
12. V. Gabillon, M. Ghavamzadeh, A. Lazaric, and S. Bubeck. Multi-bandit best arm identification. In NIPS. 2011.
13. V. Gabillon, M. Ghavamzadeh, and A. Lazaric. Best arm identification: A unified approach to fixed budget and fixed confidence. In NIPS, 2012.
14. A. Gopalan, S. Mannor, and Y. Mansour. Thompson sampling for complex online problems. In ICML, pages 100-108, 2014.
15. K. Jamieson and R. Nowak. Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting. In Information Sciences and Systems (CISS), pages 1-6. IEEE, 2014.
16. K. Jamieson, M. Malloy, R. Nowak, and S. Bubeck. lil'UCB: An optimal exploration algorithm for multi-armed bandits. COLT, 2014.
17. S. Kale, L. Reyzin, and R. E. Schapire. Non-stochastic bandit slate problems. In NIPS, 2010.
18. S. Kalyanakrishnan and P. Stone. Efficient selection of multiple bandit arms: Theory and practice. In ICML, pages 511-518, 2010.
19. S. Kalyanakrishnan, A. Tewari, P. Auer, and P. Stone. PAC subset selection in stochastic multi-armed bandits. In ICML, pages 655-662, 2012.
20. E. Kaufmann and S. Kalyanakrishnan. Information complexity in bandit subset selection. In COLT, 2013.
21. B. Kveton, Z. Wen, A. Ashkan, H. Eydgahi, and B. Eriksson. Matroid bandits: Fast combinatorial optimization with learning. In UAI, 2014.
22. T. L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Advances in applied mathematics, 6(1):4-22, 1985.
23. T. Lin, B. Abrahao, R. Kleinberg, J. Lui, and W. Chen. Combinatorial partial monitoring game with linear feedback and its application. In ICML, 2014.
24. S. Mannor and J. N. Tsitsiklis. The sample complexity of exploration in the multi-armed bandit problem. The Journal of Machine Learning Research, 5:623-648, 2004.
25. G. Neu, A. György, and C. Szepesvári. The online loop-free stochastic shortest-path problem. In COLT, pages 231-243, 2010.
26. J. G. Oxley. Matroid theory. Oxford university press, 2006.
27. D. Pollard. Asymptopia. Manuscript, Yale University, Dept. of Statist., New Haven, Connecticut, 2000.
28. O. Rivasplata. Subgaussian random variables: An expository note. 2012.
29. S. M. Ross. Stochastic processes, Volume 2. John Wiley & Sons New York, 1996.
30. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with rocketfuel. ACM SIGCOMM Computer Communication Review, 32(4):133-145, 2002.
31. Y. Zhou, X. Chen, and J. Li. Optimal PAC multiple arm identification with applications to crowdsourcing. In ICML, 2014.