Unsupervised Crowdsourcing with Accuracy and Cost Guarantees
Not on the map. Why?
Abstract (arXiv)
We consider the problem of cost-optimal utilization of a crowdsourcing platform for binary, unsupervised classification of a collection of items, given a prescribed error threshold. Workers on the crowdsourcing platform are assumed to be divided into multiple classes, based on their skill, experience, and/or past performance. We model each worker class via an unknown confusion matrix, and a (known) price to be paid per label prediction. For this setting, we propose algorithms for acquiring label predictions from workers, and for inferring the true labels of items. We prove that if the number of (unlabeled) items available is large enough, our algorithms satisfy the prescribed error thresholds, incurring a cost that is near-optimal. Finally, we validate our algorithms, and some heuristics inspired by them, through an extensive case study.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 35 references that are in the map. First posted on arXiv 5 Jul 2022.
Builds on
7 of 35 references.
References · 7
- 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 286
- 2016Optimal Best Arm Identification with Fixed Confidencecited by 239
- 2017Automatic Detection of Fake Newscited by 145
- 2014Statistical guarantees for the EM algorithm: From population to sample-based analysiscited by 133
- 2014Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcingcited by 63
- 2016Achieving Budget-optimality with Adaptive Schemes in Crowdsourcingcited by 8
- 2017Reducing Crowdsourcing to Graphon Estimation, Statisticallycited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026FUSE: Ensembling Verifiers with Zero Labeled Datacited by 4
- 2026FUSE: Ensembling Verifiers with Zero Labeled Data20 Apr 2026