Globally Optimal Crowdsourcing Quality Management
Akash Das Sarma, Aditya Parameswaran, Jennifer Widom

TL;DR
This paper develops algorithms that find globally optimal solutions for crowdsourcing quality management, improving accuracy over EM-based methods by considering all possible task answer mappings efficiently.
Contribution
It introduces algorithms that guarantee global optimality in estimating true answers and worker quality, overcoming EM's local optima limitations.
Findings
Algorithms often outperform EM-based methods in accuracy.
Significant reduction in the number of mappings considered, enabling practical computation.
Provides complexity characterization of the global optimal algorithms.
Abstract
We study crowdsourcing quality management, that is, given worker responses to a set of tasks, our goal is to jointly estimate the true answers for the tasks, as well as the quality of the workers. Prior work on this problem relies primarily on applying Expectation-Maximization (EM) on the underlying maximum likelihood problem to estimate true answers as well as worker quality. Unfortunately, EM only provides a locally optimal solution rather than a globally optimal one. Other solutions to the problem (that do not leverage EM) fail to provide global optimality guarantees as well. In this paper, we focus on filtering, where tasks require the evaluation of a yes/no predicate, and rating, where tasks elicit integer scores from a finite domain. We design algorithms for finding the global optimal estimates of correct task answers and worker quality for the underlying maximum likelihood…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Crowdsensing and Crowdsourcing · Auction Theory and Applications · Open Source Software Innovations
