paper-with-me

Papers

Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem

2013-02-13 · Ittai Abraham, Omar Alonso, Vasilis Kandylas, Aleksandrs Slivkins

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.

📄 PDF Abstract BibTeX arXiv:1302.3268

Code (0)

등록된 구현이 없습니다.

Tasks

Information RetrievalMultiple-choiceRetrievalSurvey

Similar Papers 제목 키워드 기반

Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems

2014-05-12 · Chien-Ju Ho, Aleksandrs Slivkins, Jennifer Wortman Vaughan

Crowdsourcing markets have emerged as a popular platform for matching available workers with tasks to complete. The payment for a particular task is typically set by the task's requester, and may be adjusted based on the…

Multi-Armed Bandits

Multi-Armed Bandits Meet Large Language Models

2025-05-19 · Djallel Bouneffouf, Raphael Feraud

Bandit algorithms and Large Language Models (LLMs) have emerged as powerful tools in artificial intelligence, each addressing distinct yet complementary challenges in decision-making and natural language processing. This…

Decision MakingMulti-Armed BanditsPrompt EngineeringResponse Generation+1

PAC-Bayes Bounds for Bandit Problems: A Survey and Experimental Comparison

2022-11-29 · Hamish Flynn, David Reeb, Melih Kandemir, Jan Peters

PAC-Bayes has recently re-emerged as an effective theory with which one can derive principled learning algorithms with tight performance guarantees. However, applications of PAC-Bayes to bandit problems are relatively ra…

Decision Making

A Component-Based Survey of Interactions between Large Language Models and Multi-Armed Bandits

2026-01-19 · Siguang Chen, Chunli Lv, Miao Xie arxiv

Large language models (LLMs) have become powerful and widely used systems for language understanding and generation, while multi-armed bandit (MAB) algorithms provide a principled framework for adaptive decision-making u…

Multi-Armed Bandits

Bandit-Based Task Assignment for Heterogeneous Crowdsourcing

2015-07-21 · Hao Zhang, Yao Ma, Masashi Sugiyama

We consider a task assignment problem in crowdsourcing, which is aimed at collecting as many reliable labels as possible within a limited budget. A challenge in this scenario is how to cope with the diversity of tasks an…

Diversity