AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

A Minimax Optimal Algorithm for Crowdsourcing

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use TE instead of S-EM10worker-reliability estimation · Synthetic instance (iii), b=1estimation error: 0.389 -> 0.061Helped
Use TE instead of S-EM10worker-reliability estimation · Synthetic instance (i), a=0.3estimation error: 0.041 -> 0.134Hurt
Use TE instead of S-EM10worker-reliability estimation · Synthetic instance (iii), b=sqrt(n)estimation error: 0.030 -> 0.045Hurt
Use TE rather than S-EM initialization followed by EMbinary-label worker-reliability estimation · Crowdsourcing parameter estimationminimax estimation errorNo clear effect
Use TE instead of S-EM10ground-truth prediction · Synthetic instance (iii), b=1prediction error: 0.404 -> 0.192Mixed
Use TE instead of majority votingground-truth prediction · RTEprediction error: 0.10 -> 0.38Hurt
Use TE instead of majority votingground-truth prediction · Birdprediction error: 0.24 -> 0.18Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy