POMDP-based control of workflows for crowdsourcing

被引:65
作者
Dai, Peng [1 ]
Lin, Christopher H. [1 ]
Mausam [1 ]
Weld, Daniel S. [1 ]
机构
[1] Univ Washington, Dept Comp Sci & Engn, Seattle, WA 98195 USA
基金
美国国家科学基金会;
关键词
Partially-Observable Markov Decision; Process; POMDP; Planning under uncertainty; Crowdsourcing; VALUE-ITERATION;
D O I
10.1016/j.artint.2013.06.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Crowdsourcing, outsourcing of tasks to a crowd of unknown people ("workers") in an open call, is rapidly rising in popularity. It is already being heavily used by numerous employers ("requesters") for solving a wide variety of tasks, such as audio transcription, content screening, and labeling training data for machine learning. However, quality control of such tasks continues to be a key challenge because of the high variability in worker quality. In this paper we show the value of decision-theoretic techniques for the problem of optimizing workflows used in crowdsourcing. In particular, we design Al agents that use Bayesian network learning and inference in combination with Partially-Observable Markov Decision Processes (POMDPs) for obtaining excellent cost-quality tradeoffs. We use these techniques for three distinct crowdsourcing scenarios: (1) control of voting to answer a binary-choice question, (2) control of an iterative improvement workflow, and (3) control of switching between alternate workflows for a task. In each scenario, we design a Bayes net model that relates worker competency, task difficulty and worker response quality. We also design a POMDP for each task, whose solution provides the dynamic control policy. We demonstrate the usefulness of our models and agents in live experiments on Amazon Mechanical Turk. We consistently achieve superior quality results than non-adaptive controllers, while incurring equal or less cost. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:52 / 85
页数:34
相关论文
共 67 条
[1]  
[Anonymous], HCOMP
[2]  
[Anonymous], AAAI
[3]  
[Anonymous], 2011, SYNTHESIS LECT ARTIF
[4]  
[Anonymous], P CROWDCONF
[5]  
[Anonymous], 2003, Proceedings of CHI 2003: Human Factorsin Computing Systems
[6]  
[Anonymous], 2001, Sequential Monte Carlo methods in practice
[7]  
[Anonymous], 2010, P 23ND ANN ACM S USE, DOI 10.1145/1866029.1866078
[8]  
[Anonymous], 2012, Online Task Assignment in Crowdsourcing Markets
[9]  
[Anonymous], NOW SOMETHING UNPUB
[10]  
[Anonymous], S ART INT MATH