Recovering Top-Two Answers and Confusion Probability in Multi-Choice Crowdsourcing
Not on the map. Why?
Abstract (arXiv)
Crowdsourcing has emerged as an effective platform for labeling large amounts of data in a cost- and time-efficient manner. Most previous work has focused on designing an efficient algorithm to recover only the ground-truth labels of the data. In this paper, we consider multi-choice crowdsourcing tasks with the goal of recovering not only the ground truth, but also the most confusing answer and the confusion probability. The most confusing answer provides useful information about the task by revealing the most plausible answer other than the ground truth and how plausible it is. To theoretically analyze such scenarios, we propose a model in which there are the top two plausible answers for each task, distinguished from the rest of the choices. Task difficulty is quantified by the probability of confusion between the top two, and worker reliability is quantified by the probability of giving an answer among the top two. Under this model, we propose a two-stage inference algorithm to infer both the top two answers and the confusion probability. We show that our algorithm achieves the minimax optimal convergence rate. We conduct both synthetic and real data experiments and demonstrate that our algorithm outperforms other recent algorithms. We also show the applicability of our algorithms in inferring the difficulty of tasks and in training neural networks with top-two soft labels.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 47 references that are in the map. First posted on arXiv 29 Dec 2022.
Builds on
18 of 47 references.
References · 18
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2019Human uncertainty makes classification more robustcited by 235
- 2014Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcingcited by 63
- 2018PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Reviewcited by 30
- 2019Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithmscited by 23
- 2014Error Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcingcited by 21
- 2020Adversarial Crowdsourcing Through Robust Rank-One Matrix Completioncited by 21
- 2016A Permutation-based Model for Crowd Labeling: Optimal Estimation and Robustnesscited by 13
- 2013Consistency of weighted majority votescited by 11
- 2019Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workerscited by 11
- 2013Spectral Clustering via the Power Method -- Provablycited by 10
- 2016Exact Exponent in Optimal Rates for Crowdsourcingcited by 10
6 more
- 2022GenLabel: Mixup Relabeling using Generative Modelscited by 10
- 2016Achieving Budget-optimality with Adaptive Schemes in Crowdsourcingcited by 8
- 2013Minimax Optimal Convergence Rates for Estimating Ground Truth from Crowdsourced Labelscited by 7
- 2017Reducing Crowdsourcing to Graphon Estimation, Statisticallycited by 7
- 2021Truth Discovery in Sequence Labels from Crowdscited by 6
- 2022Integrating Rankings into Quantized Scores in Peer Reviewcited by 2
Built on by
Not cited yet.