Bandit-based task assignment for heterogeneous crowdsourcing

DOI10.1162/NECO_A_00782MaRDI QIDQ5380349zbMATH OpenWikidataFDO

Authors Hao Zhang, Yao Ma, Masashi Sugiyama

Publication date 4 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.05800

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Abstract: 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 and the task-dependent reliability of workers, e.g., a worker may be good at recognizing the name of sports teams, but not be familiar with cosmetics brands. We refer to this practical setting as heterogeneous crowdsourcing. In this paper, we propose a contextual bandit formulation for task assignment in heterogeneous crowdsourcing, which is able to deal with the exploration-exploitation trade-off in worker selection. We also theoretically investigate the regret bounds for the proposed method, and demonstrate its practical usefulness experimentally.

Recommendations

• Efficient crowdsourcing of unknown experts using multi-armed bandits
• Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
• Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
• Quality-aware online task assignment mechanisms using latent topic model
• Maximizing user type diversity for task assignment in crowdsourcing

Cites work

• Approximating the crowd
• Finite-time analysis of the multiarmed bandit problem
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• Online learning and online convex optimization
• Prediction, Learning, and Games
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• The multiplicative weights update method: a meta-algorithm and applications
• The Nonstochastic Multiarmed Bandit Problem

Cited in

(18)

• A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
• Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
• A task assignment approach with maximizing user type diversity in mobile crowdsensing
• A unified task recommendation strategy for realistic mobile crowdsourcing system
• Quality-aware online task assignment mechanisms using latent topic model
• POMDP-based control of workflows for crowdsourcing
• Task design in complex crowdsourcing experiments: item assignment optimization
• Deep learning-based recommendation method for top-K tasks in software crowdsourcing systems
• Time-sensitive Bayesian information aggregation for crowdsourcing systems
• Efficient crowdsourcing of unknown experts using multi-armed bandits
• Bayesian methods for intelligent task assignment in crowdsourcing systems
• Identifying unreliable and adversarial workers in crowdsourced labeling tasks
• Optimal stopping and worker selection in crowdsourcing: an adaptive sequential probability ratio test framework
• Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
• Credit and quality intelligent learning based multi-armed bandit scheme for unknown worker selection in multimedia MCS
• Optimal permutation estimation in crowdsourcing problems
• Mathematical programming and machine learning for a task allocation game
• Maximizing user type diversity for task assignment in crowdsourcing

This page was built for publication: Bandit-based task assignment for heterogeneous crowdsourcing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380349)