mlsanityData to 14 Oct 2026

Detecting adversaries in Crowdsourcing

arXiv 2110.04117 ↗First posted 7 Oct 2021cs.LG cs.HC stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Despite its successes in various machine learning and data science tasks, crowdsourcing can be susceptible to attacks from dedicated adversaries. This work investigates the effects of adversaries on crowdsourced classification, under the popular Dawid and Skene model. The adversaries are allowed to deviate arbitrarily from the considered crowdsourcing model, and may potentially cooperate. To address this scenario, we develop an approach that leverages the structure of second-order moments of annotator responses, to identify large numbers of adversaries, and mitigate their impact on the crowdsourcing task. The potential of the proposed approach is empirically demonstrated on synthetic and real crowdsourcing datasets.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 15 of its 42 references that are in the map. First posted on arXiv 7 Oct 2021.

Builds on

15 of 42 references.

References · 15

  1. 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 425
  2. 2014Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcingcited by 63
  3. 2016Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clusteringcited by 40
  4. 2019Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithmscited by 23
  5. 2020Adversarial Crowdsourcing Through Robust Rank-One Matrix Completioncited by 21
  6. 2014Estimating the Accuracies of Multiple Classifiers Without Labeled Datacited by 17
  7. 2013Greedy Feature Selection for Subspace Clusteringcited by 11
  8. 2017Sketched Subspace Clusteringcited by 11
  9. 2019Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workerscited by 11
  10. 2014Greedy Subspace Clusteringcited by 10
  11. 2016Certifiably Optimal Low Rank Factor Analysiscited by 10
  12. 2017Blind Multiclass Ensemble Classificationcited by 8
3 more
  1. 2018Static and Dynamic Robust PCA and Matrix Completion: A Reviewcited by 6
  2. 2015Algebraic Clustering of Affine Subspacescited by 3
  3. 2018Efficient Solvers for Sparse Subspace Clusteringcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.