Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem (1302.3268v2)

Published 13 Feb 2013 in cs.LG

Abstract: Very recently crowdsourcing has become the de facto platform for distributing and collecting human computation for a wide range of tasks and applications such as information retrieval, natural language processing and machine learning. Current crowdsourcing platforms have some limitations in the area of quality control. Most of the effort to ensure good quality has to be done by the experimenter who has to manage the number of workers needed to reach good results. We propose a simple model for adaptive quality control in crowdsourced multiple-choice tasks which we call the \emph{bandit survey problem}. This model is related to, but technically different from the well-known multi-armed bandit problem. We present several algorithms for this problem, and support them with analysis and simulations. Our approach is based in our experience conducting relevance evaluation for a large commercial search engine.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Ittai Abraham (38 papers)
  2. Omar Alonso (12 papers)
  3. Vasilis Kandylas (4 papers)
  4. Aleksandrs Slivkins (67 papers)
Citations (61)

Summary

We haven't generated a summary for this paper yet.