mlsanityData to 14 Oct 2026

A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits

arXiv 2111.12550 ↗First posted 19 Nov 2021cs.HC cs.IT cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Crowdsourcing system has emerged as an effective platform for labeling data with relatively low cost by using non-expert workers. Inferring correct labels from multiple noisy answers on data, however, has been a challenging problem, since the quality of the answers varies widely across tasks and workers. Many existing works have assumed that there is a fixed ordering of workers in terms of their skill levels, and focused on estimating worker skills to aggregate the answers from workers with different weights. In practice, however, the worker skill changes widely across tasks, especially when the tasks are heterogeneous. In this paper, we consider a new model, called d-type specialization model, in which each task and worker has its own (unknown) type and the reliability of each worker can vary in the type of a given task and that of a worker. We allow that the number d of types can scale in the number of tasks. In this model, we characterize the optimal sample complexity to correctly infer the labels within any given accuracy, and propose label inference algorithms achieving the order-wise optimal limit even when the types of tasks or those of workers are unknown. We conduct experiments both on synthetic and real datasets, and show that our algorithm outperforms the existing algorithms developed based on more strict model assumptions.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 28 of its 78 references that are in the map. First posted on arXiv 19 Nov 2021.

Builds on

28 of 78 references.

References · 28

  1. 2014Exact Recovery in the Stochastic Block Modelcited by 78
  2. 2014Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcingcited by 63
  3. 2020A Faster Interior Point Method for Semidefinite Programmingcited by 53
  4. 2017Learning From Noisy Singly-labeled Datacited by 50
  5. 2017Clustering with Noisy Queriescited by 34
  6. 2021Solving SDP Faster: A Robust IPM Framework and Efficient Implementationcited by 33
  7. 2014Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatricescited by 29
  8. 2019Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithmscited by 23
  9. 2014On semidefinite relaxations for the block modelcited by 22
  10. 2014Error Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcingcited by 21
  11. 2020Adversarial Crowdsourcing Through Robust Rank-One Matrix Completioncited by 21
  12. 2014Robust and computationally feasible community detection in the presence of arbitrary outlier nodescited by 17
16 more
  1. 2017Community Detection in Hypergraphs, Spiked Tensor Models, and Sum-of-Squarescited by 17
  2. 2015Convexified Modularity Maximization for Degree-corrected Stochastic Block Modelscited by 16
  3. 2016A Permutation-based Model for Crowd Labeling: Optimal Estimation and Robustnesscited by 13
  4. 2017Community Recovery in Hypergraphscited by 12
  5. 2013Consistency of weighted majority votescited by 11
  6. 2019Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workerscited by 11
  7. 2016Exact Exponent in Optimal Rates for Crowdsourcingcited by 10
  8. 2016Achieving Budget-optimality with Adaptive Schemes in Crowdsourcingcited by 8
  9. 2013Minimax Optimal Convergence Rates for Estimating Ground Truth from Crowdsourced Labelscited by 7
  10. 2017Reducing Crowdsourcing to Graphon Estimation, Statisticallycited by 7
  11. 2020Robust Hypergraph Clustering via Convex Relaxation of Truncated MLEcited by 7
  12. 2015Regularized Minimax Conditional Entropy for Crowdsourcingcited by 6
  13. 2017Exponential error rates of SDP for block models: Beyond Grothendieck's inequalitycited by 4
  14. 2017Fundamental Limits on Data Acquisition: Trade-offs between Sample Complexity and Query Difficultycited by 1
  15. 2020Binary Classification with XOR Queries: Fundamental Limits and An Efficient Algorithmcited by 1
  16. 2020Crowdsourced Labeling for Worker-Task Specialization Modelcited by 1

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.