Bandit-based task assignment for heterogeneous crowdsourcing
From MaRDI portal
Publication:5380349
DOI10.1162/NECO_A_00782zbMATH Open1472.68167arXiv1507.05800WikidataQ45949500 ScholiaQ45949500MaRDI QIDQ5380349FDOQ5380349
Authors: Hao Zhang, Yao Ma, Masashi Sugiyama 
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1507.05800
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
- Title not available (Why is that?)
- Prediction, Learning, and Games
- The Nonstochastic Multiarmed Bandit Problem
- Finite-time analysis of the multiarmed bandit problem
- Online learning and online convex optimization
- The multiplicative weights update method: a meta-algorithm and applications
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Approximating the crowd
Cited In (18)
- Maximizing user type diversity for task assignment in crowdsourcing
- A unified task recommendation strategy for realistic mobile crowdsourcing system
- Quality-aware online task assignment mechanisms using latent topic model
- Task design in complex crowdsourcing experiments: item assignment optimization
- Optimal permutation estimation in crowdsourcing problems
- A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
- Mathematical programming and machine learning for a task allocation game
- POMDP-based control of workflows for crowdsourcing
- Time-sensitive Bayesian information aggregation for crowdsourcing systems
- Bayesian methods for intelligent task assignment in crowdsourcing systems
- Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
- Optimal stopping and worker selection in crowdsourcing: an adaptive sequential probability ratio test framework
- Credit and quality intelligent learning based multi-armed bandit scheme for unknown worker selection in multimedia MCS
- Identifying unreliable and adversarial workers in crowdsourced labeling tasks
- A task assignment approach with maximizing user type diversity in mobile crowdsensing
- Efficient crowdsourcing of unknown experts using multi-armed bandits
- Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
- Deep learning-based recommendation method for top-\(K\) tasks in software crowdsourcing systems
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)
