Optimistic knowledge gradient policy for optimal budget allocation in crowdsourcing

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 1101-1109

  Chen, Xi ^a   Lin, Qihang ^b   Zhou, Dengyong ^c  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; MARKOV PROCESSES; OPTIMIZATION;

BAYESIAN; BUDGET ALLOCATION; COMPUTATIONAL CHALLENGES; CONTEXTUAL INFORMATION; CROWDSOURCING; DYNAMIC PROGRAMMING ALGORITHM; MARKOV DECISION PROCESSES; OPTIMAL ALLOCATION;

BUDGET CONTROL;

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

References (25)

1. Bachrach, Y., Minka, T., Guiver, J., and Graepel, T. How to grade a test without knowing the answers - a Bayesian graphical model for adaptive crowdsourcing and aptitude testing, In ICML, 2012.
2. Bishop, C. M. Pattern Recognition and Machine Learning. Springer, 2007.
3. Dawid, A. P. and Skene, A. M. Maximum likelihood estimation of observer error-rates using the em algorithm. JRSS-C, 28:20-28, 1979.
4. Ertekin, S., Hirsh, H., and Rudin, C. Wisely using a budget for crowdsourcing. Technical report, MIT, 2012.
5. Frazier, P., Powell, W. B., and Dayanik, S. A knowledge-gradient policy for sequential information collection. SIAM J. Control Optim., 47(5): 2410-2439, 2008.
6. Gittins, J. C. Multi-armed Bandit Allocation Indices. John Wiley & Sons, 1989.
7. Gupta, S. S. and Miescke, K.J. Bayesian look ahead one stage sampling allocations for selection the largest normal mean. J. of Stat. Planning and Inference, 54(2):229-244, 1996. (Pubitemid 126161097)
8. Karger, D. R., Oh, S., and Shah, D. Budget-optimal task allocation for reliable crowdsourcing systems. arXiv:1110.3564v3, 11 2012.
9. Liu, C. and Wang, Y. M. Truelabel + confusions: A spectrum of probabilistic models in analyzing multiple ratings. In ICML, 2012.
10. Liu, Q., Peng, J., and Ihler, A. Variational inference for crowdsourcing. In NIPS, 2012.
11. Nino-Mora, J. Computing a classic index for finite-horizon bandits. INFORMS Journal on Computing, 23(2):254-267, 2011.
12. Nowak, R. D. Noisy generalized binary search. In NIPS, 2009.
13. Pfeiffer, T., Gao, X. A., Mao, A., Chen, Y., and Rand, D. G. Adaptive polling for information aggregation. In AAAI, 2012.
14. Powell, W. B. Approximate Dynamic Programming: solving the curses of dimensionality. John Wiley & Sons, 2007.
15. Puterman, M. L. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, 2005.
16. Raykar, V. C., Yu, S., Zhao, L. H., Valadez, G. H, Florin, C., Bogoni, L., and Moy, L. Learning from crowds. JMLR, 11:1297-1322, 2010.
17. Robert, Christian P. The Bayesian Choice: From Decision-Theoretic Foundations to Computational Implementation. Springer Verlag, 2007.
18. Rockafellar, R. T. and Uryasev, S. Conditional value-at-risk for general loss distributions. J. of Banking and Finance, 26:1443-1471, 2002.
19. Settles, B. Active learning literature survey. Technical report, University of Wisconsin-Madison, 2009.
20. Snow, R., Connor, B. O., Jurafsky, D., and Ng., A. Y. Cheap and fast - but is it good? evaluating nonexpert annotations for natural language tasks. In EMNLP, 2008.
21. Welinder, P., Branson, S., Belongie, S., and Perona, P. The multidimensional wisdom of crowds. In NIPS, 2010.
22. Whitehill, J., Ruvolo, P., Wu, T., Bergsma, J., and Movellan, J. R. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. In NIPS, 2009.
23. Xie, J. and Frazier, P. I. Sequential bayes-optimal policies for multiple comparions with a control. Technical report, Cornell University, 2012.
24. Yan, Y., Rosales, R., Fung, G., and Dy, J. Active learning from crowds. In ICML, 2011.
25. Zhou, D., Basu, S., Mao, Y., and Platt, J. Learning from the wisdom of crowds by minimax conditional entropy. In NIPS, 2012.