{
  "id": "1602.03619",
  "version": "v1",
  "published": "2016-02-11T05:35:19.000Z",
  "updated": "2016-02-11T05:35:19.000Z",
  "title": "Optimality of Belief Propagation for Crowdsourced Classification",
  "authors": [
    "Jungseul Ok",
    "Sewoong Oh",
    "Jinwoo Shin",
    "Yung Yi"
  ],
  "categories": [
    "cs.LG",
    "stat.ML"
  ],
  "abstract": "Crowdsourcing systems are popular for solving large-scale labelling tasks with low-paid (or even non-paid) workers. We study the problem of recovering the true labels from the possibly erroneous crowdsourced labels under the popular Dawid-Skene model. To address this inference problem, several algorithms have recently been proposed, but the best known guarantee is still significantly larger than the fundamental limit. We close this gap under a simple but canonical scenario where each worker is assigned at most two tasks. In particular, we introduce a tighter lower bound on the fundamental limit and prove that Belief Propagation (BP) exactly matches this lower bound. The guaranteed optimality of BP is the strongest in the sense that it is information-theoretically impossible for any other algorithm to correctly label a larger fraction of the tasks. In the general setting, when more than two tasks are assigned to each worker, we establish the dominance result on BP that it outperforms all existing algorithms with provable guarantees. Experimental results suggest that BP is close to optimal for all regimes considered, while all other algorithms show suboptimal performances in certain regimes.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-02-11T05:35:19.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "belief propagation",
      "crowdsourced classification",
      "optimality",
      "fundamental limit",
      "tighter lower bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160203619O"
    }
  }
}