Optimal PAC multiple arm identification with applications to crowdsourcing

31st International Conference on Machine Learning, ICML 2014

Volumn 2, Issue , 2014, Pages 1446-1469

  Zhou, Yuan ^a   Chen, Xi ^b   Li, Jian ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; ALGORITHMS; ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; STOCHASTIC SYSTEMS;

AVERAGE REWARD; EVALUATION METRICS; MISIDENTIFICATION PROBABILITY; OPTIMAL SOLUTIONS; REGRET BOUNDS; SAMPLE COMPLEXITY; SAMPLE COMPLEXITY BOUNDS; SYNTHETIC AND REAL DATA;

COMPUTATIONAL COMPLEXITY;

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

References (24)

1. Anthony, M and Bartlett, P. L. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.
2. Audibert, J.-Y, Bubeck, S, and Lugosi, G. Regret in online combinatorial optimization. Mathematics of Operations Research, 2013.
3. Audibert, J, Bubeck, S, and Munos, R. Best arm identification in multi-armed bandits. In Proceedings of the Annual Conference on Learning Theory (COLT), 2010.
4. Auer, P, Cesa-Bianchi, N, Freund, Y, and Schapire, R. The nonstochastic multiarmed bandit problem. SIAM J. on Comput, 32(1):48-77, 2002a.
5. Auer, P, Cesa-Bianchi, N, and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002b.
6. Beygelzimer, A, Langford, J, Li, L, Reyzin, L, and Schapire, R. E. Contextual bandit algorithms with supervised learning guarantees. In Proceedings of International Conference on Artificial Intelligence and Statistics, 2011.
7. Bubeck, S and Cesa-Bianchi, N. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning, 5(1): 1-122, 2012.
8. Bubeck, S, Wang, T, and Viswanathan, N. Multiple identifications in multi-armed bandits. In Proceedings of the International Conference on Machine Learning, 2013.
9. Chen, W, Wang, Y, and Yuan, Y. Combinatorial multi-armed bandit: General framework, results and applications. In Proceedings of International Conference on Machine Learning, 2013a.
10. Chen, X, Lin, Q, and Zhou, D. Optimistic knowledge gradient for optimal budget allocation in crowdsourcing. In Proceedings of International Conference on Machine Learning, 2013b.
11. Chernoff, H. Sequential Analysis and Optimal Design. Society for Industrial and Applied Mathematics (SIAM), 1972.
12. Even-Dar, E, Mannor, S, and Mansour, Y. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of machine learning research, 7:1079-1105, 2006.
13. Ho, C.-I, Jabbari, S, and Vaughan, J. W. Adaptive task assignment for crowdsourced classification. In ICML, 2013.
14. Kalyanakrishnan, S and Stone, P. Efficient selection of multiple bandit arms: Theory and practice. In Proceedings of International Conference of Machine Learning, 2010.
15. Kalyanakrishnan, S, Tewari, A, Auer, P, and Stone, P. PAC subset selection in stochastic multi-armed bandits. In Proceedings of International Conference on Machine Learning, 2012.
16. Karger, D. R, Oh, S, and Shah, D. Budget-optimal task allocation for reliable crowdsourcing systems. arXiv:1110.3564v3, 11 2012.
17. Karnin, Z, Koren, T, and Somekh, O. Almost optimal exploration in multi-armed bandits. In Proceedings of International Conference on Machine Learning, 2013.
18. Koenig, L. W and Law, A. M. A procedure for selecting a subset of size m containing the I best of k independent normal populations, with applications to simulation. Communications in statistics. Simulation and computation, 14:719-734, 1985.
19. Mannor, S and Tsitsiklis, J. N. The sample complexity of exploration in the multi-armed bandit problem. Journal of Machine Learning Research, 5:623-648, 2004.
20. Raykar, V. C, Yu, S, Zhao, L. H, Valadez, G. H, Florin, C, Bogoni, L, and Moy, L. Learning from crowds. Journal of Machine Learning Research, 11:1297-1322, 2010.
21. Schmidt, C, Branke, J, and Chick, S. E. Integrating techniques from statistical ranking into evolutionary algorithms. 2006.
22. Snow, R, Connor, B. O, Jurafsky, D, and Ng., A. Y. Cheap and fast - but is it good? evaluating non-expert annotations for natural language tasks. In EMNLP, 2008.
23. Thompson, W. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25:285-294, 1933.
24. Zhou, D, Basu, S, Mao, Y, and Piatt, J. Learning from the wisdom of crowds by minimax conditional entropy. In NIPS. 2012.