Best arm identification: A unified approach to fixed budget and fixed confidence

Advances in Neural Information Processing Systems

Volumn 4, Issue , 2012, Pages 3212-3220

  Gabillon, Victor ^a   Ghavamzadeh, Mohammad ^a   Lazaric, Alessandro ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON STRUCTURES; FIXED BUDGET; MULTI ARMED BANDIT; PERFORMANCE BOUNDS; UNIFIED APPROACH;

ALGORITHMS;

BUDGET CONTROL;

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

References (15)

1. J.-Y. Audibert, S. Bubeck, and R. Munos. Best arm identification in multi-armed bandits. In Proceedings of the Twenty-Third Annual Conference on Learning Theory, pages 41-53, 2010.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multi-armed bandit problem. Machine Learning, 47:235-256, 2002.
3. S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in multi-armed bandit problems. In Proceedings of the Twentieth International Conference on Algorithmic Learning Theory, pages 23-37, 2009.
4. S. Bubeck, T. Wang, and N. Viswanathan. Multiple identifications in multi-armed bandits. CoRR, abs/1205.3181, 2012.
5. K. Deng, J. Pineau, and S. Murphy. Active learning for developing personalized treatment. In Proceedings of the Twenty-Seventh International Conference on Uncertainty in Artificial Intelligence, pages 161-168, 2011.
6. E. Even-Dar, S. Mannor, and Y. Mansour. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7:1079-1105, 2006.
7. V. Gabillon, M. Ghavamzadeh, and A. Lazaric. Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence. Technical report 00747005, October 2012.
8. V. Gabillon, M. Ghavamzadeh, A. Lazaric, and S. Bubeck. Multi-bandit best arm identification. In Proceedings of Advances in Neural Information Processing Systems 25, pages 2222-2230, 2011.
9. S. Kalyanakrishnan. Learning Methods for Sequential Decision Making with Imperfect Representations. PhD thesis, Department of Computer Science, The University of Texas at Austin, Austin, Texas, USA, December 2011. Published as UT Austin Computer Science Technical Report TR-11-41.
10. S. Kalyanakrishnan and P. Stone. Efficient selection of multiple bandit arms: Theory and practice. In Proceedings of the Twenty-Seventh International Conference on Machine Learning, pages 511-518, 2010.
11. S. Kalyanakrishnan, A. Tewari, P. Auer, and P. Stone. Pac subset selection in stochastic multiarmed bandits. In Proceedings of the Twentieth International Conference on Machine Learning, 2012.
12. O. Maron and A. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. In Proceedings of Advances in Neural Information Processing Systems 6, pages 59-66, 1993.
13. A. Maurer and M. Pontil. Empirical bernstein bounds and sample-variance penalization. In 22th annual conference on learning theory, 2009.
14. V. Mnih, Cs. Szepesvári, and J.-Y. Audibert. Empirical Bernstein stopping. In Proceedings of the Twenty-Fifth International Conference on Machine Learning, pages 672-679, 2008.
15. H. Robbins. Some aspects of the sequential design of experiments. Bulletin of the American Mathematics Society, 58:527-535, 1952.