MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Budget-Optimal Crowdsourcing Using Low-Rank Matrix Approximations

Author(s)
Karger, David R.; Oh, Sewoong; Shah, Devavrat
Thumbnail
DownloadKarger_Budget-optimal crowdsourcing.pdf (259.3Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous "information piece- workers", 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 crowdsourcers must devise schemes to increase confidence in their answers, typically by assigning each task multiple times and combining the answers in some way such as majority voting. In this paper, we consider a 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, based on low-rank matrix approximation, significantly outperforms majority voting and, in fact, is order-optimal through comparison to an oracle that knows the reliability of every worker.
Date issued
2011-09
URI
http://hdl.handle.net/1721.1/73458
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Karger, David R., Sewoong Oh, and Devavrat Shah. “Budget-optimal Crowdsourcing Using Low-rank Matrix Approximations.” 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011. 284–291.
Version: Author's final manuscript
ISBN
978-1-4577-1817-5

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.