The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
Abstract
Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous “information pieceworkers,” have emerged as an effective paradigm for human-powered solving of large-scale problems in domains such as image classification, data entry, optical character recognition, recommendation, and proofreading. Because these low-paid workers can be unreliable, nearly all such systems must devise schemes to increase confidence in their answers, typically by assigning each task multiple times and combining the answers in an appropriate manner, e.g., majority voting. In this paper, we consider a general model of such crowdsourcing tasks and pose the problem of minimizing the total price (i.e., number of task assignments) that must be paid to achieve a target overall reliability. We give a new algorithm for deciding which tasks to assign to which workers and for inferring correct answers from the workers' answers. We show that our algorithm, inspired by belief propagation and low-rank matrix approximation, significantly outperforms majority voting and, in fact, is optimal through comparison to an oracle that knows the reliability of every worker. Further, we compare our approach with a more general class of algorithms that can dynamically assign tasks. By adaptively deciding which questions to ask to the next set of arriving workers, one might hope to reduce uncertainty more efficiently. We show that, perhaps surprisingly, the minimum price necessary to achieve a target reliability scales in the same manner under both adaptive and nonadaptive scenarios. Hence, our nonadaptive approach is order optimal under both scenarios. This strongly relies on the fact that workers are fleeting and cannot be exploited. Therefore, architecturally, our results suggest that building a reliable worker-reputation system is essential to fully harnessing the potential of adaptive designs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1988) · Cited by 16,582
Bollobás, B. (1985) · Cited by 6,196
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Color Science, Concepts and Methods. Quantitative Data and Formulas
Wright, W. D. (1967) · Physics Bulletin · doi:10.1088/0031-9112/18/10/010 · Cited by 3,540
Probabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Richardson, T., & Urbanke, R. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511791338 · Cited by 2,271
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Maximum Likelihood Estimation of Observer Error-Rates Using the EM Algorithm
Dawid, A. P., & Skene, A. M. (1979) · Applied Statistics · doi:10.2307/2346806 · Cited by 1,692
Understanding belief propagation and its generalizations
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2003) · Cited by 1,594
Get another label? improving data quality and data mining using multiple, noisy labelers
Sheng, V. S., Provost, F., & Ipeirotis, P. G. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401965 · Cited by 1,165
Selective Sampling Using the Query by Committee Algorithm
Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997) · Machine Learning · doi:10.1023/a:1007330508534 · Cited by 1,097
Whose Vote Should Count More: Optimal Integration of Labels from Labelers of Unknown Expertise
Whitehill, J., Wu, T., Bergsma, J., Movellan, J. R., & Ruvolo, P. (2009) · Cited by 1,004
Quality management on Amazon Mechanical Turk
Ipeirotis, P. G., Provost, F., & Wang, J. (2010) · Proceedings of the ACM SIGKDD Workshop on Human Computation · doi:10.1145/1837885.1837906 · Cited by 973
Raykar, V. C., Yu, S., Zhao, L. H., Valadez, G. H., Florin, C., Bogoni, L., & Moy, L. P. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859894 · Cited by 951
Analyzing the Amazon Mechanical Turk marketplace
Ipeirotis, P. G. (2010) · XRDS: Crossroads, The ACM Magazine for Students · doi:10.1145/1869086.1869094 · Cited by 879
The multidimensional wisdom of crowds
Welinder, P., Branson, S., Belongie, S., & Perona, P. (2010) · CaltechAUTHORS (California Institute of Technology) · Cited by 742
Soylent: a word processor with a crowd inside
Bernstein, M. S., Little, G., Miller, R. C., Hartmann, B., Ackerman, M. S., Karger, D. R., Crowell, D., & Panovich, K. (2010) · Proceedings of the 23nd annual ACM symposium on User interface software and technology · doi:10.1145/1866029.1866078 · Cited by 686
Self-citationAgreement over random networks
Hatano, Y., & Mesbahi, M. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1430343 · Cited by 550
VizWiz: nearly real-time answers to visual questions
Bigham, J. P., Jayant, C., Ji, H., Little, G., Miller, A., Miller, R. C., Tatarowicz, A., White, B., White, S., & Yeh, T. (2010) · Proceedings of the 2010 International Cross Disciplinary Conference on Web Accessibility (W4A) · doi:10.1145/1805986.1806020 · Cited by 536
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.858670 · Cited by 503
Financial incentives and the "performance of crowds"
Mason, W., & Watts, D. J. (2010) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1809400.1809422 · Cited by 463
Color Science Concepts and Methods
Wyszecki, G. (1982) · Medical Entomology and Zoology · Cited by 407
Tversky, A., & Kahneman, D. (1993) · Readings in Philosophy and Cognitive Science · doi:10.7551/mitpress/5782.003.0006 · Cited by 348
Jin, R., & Ghahramani, Z. (2002) · UCL Discovery (University College London) · Cited by 307
Crowds in two seconds: enabling realtime crowd-powered interfaces
Bernstein, M. S., Brandt, J., Miller, R. C., & Karger, D. R. (2011) · Proceedings of the 24th annual ACM symposium on User interface software and technology · doi:10.1145/2047196.2047201 · Cited by 302
Self-citationVariational Inference for Crowdsourcing
Liu, Q., Peng, J., & Ihler, A. (2012) · Cited by 301
The weighted majority algorithm
Littlestone, N., & Warmuth, M. K. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63487 · Cited by 295
Broadcasting on trees and the Ising model
Evans, W., Kenyon, C., Peres, Y., & Schulman, L. J. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487349 · Cited by 270
Inferring Ground Truth from Subjective Labelling of Venus Images
Smyth, P., Fayyad, U. M., Burl, M. C., Perona, P., & Baldi, P. (1994) · CaltechAUTHORS (California Institute of Technology) · Cited by 268
Eliminating spammers and ranking annotators for crowdsourced labeling tasks
Raykar, V. C., Yu, S., & Taskar, B. (2012) · Cited by 266
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Yan, T., Kumar, V., & Ganesan, D. (2010) · Proceedings of the 8th international conference on Mobile systems, applications, and services · doi:10.1145/1814433.1814443 · Cited by 255
Efficiently learning the accuracy of labeling sources for selective sampling
Donmez, P., Carbonell, J. G., & Schneider, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557053 · Cited by 218
Task search in a human computation market
Chilton, L. B., Horton, J. J., Miller, R. C., & Azenkot, S. (2010) · Proceedings of the ACM SIGKDD Workshop on Human Computation · doi:10.1145/1837885.1837889 · Cited by 171
Budget-optimal crowdsourcing using low-rank matrix approximations
Karger, D. R., Oh, S., & Shah, D. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120180 · Cited by 146
Self-citationWhat's the right price? pricing tasks for finishing on time
Faridani, S., Hartmann, B., & Ipeirotis, P. G. (2011) · Cited by 126
Active Learning in the Non-realizable Case
Kääriäinen, M. (2006) · Lecture notes in computer science · doi:10.1007/11894841_9 · Cited by 95
Active Learning from Multiple Noisy Labelers with Varied Costs
Zheng, Y., Scott, S., & Deng, K. (2010) · Proceedings · doi:10.1109/icdm.2010.147 · Cited by 47
Cited by
Crowdsourcing: A Review and Suggestions for Future Research
Ghezzi, A., Gabelloni, D., Martini, A., & Natalicchio, A. (2018) · International Journal of Management Reviews · doi:10.1111/ijmr.12135 · Cited by 353
Daniel, F., Kucherbaev, P., Cappiello, C., Benatallah, B., & Allahbakhsh, M. (2019) · ACM Computing Surveys · doi:10.1145/3148148 · Cited by 313
Learning from crowdsourced labeled data: a survey
Zhang, J., Wu, X., & Sheng, V. S. (2016) · Artificial Intelligence Review · doi:10.1007/s10462-016-9491-9 · Cited by 203
Cognitive Biases in Crowdsourcing
Eickhoff, C. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159654 · Cited by 144
A technical survey on statistical modelling and design methods for crowdsourcing quality control
Jin, Y., Carman, M., Zhu, Y., & Xiang, Y. (2020) · Artificial Intelligence · doi:10.1016/j.artint.2020.103351 · Cited by 28
Metadata
- Authors
- Karger, D. R., Oh, S., & Shah, D.
- Venue
- Operations Research
- Published
- 2014-02
- Volume
- 62
- Issue
- 1
- Pages
- 1-24
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2163522723
- Cited by
- 297
- References
- 39
- FWCI
- 51.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.