Research map / Learning theory and algorithms / Prediction and decision losses
Fundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Make workers' skill levels known to the crowdsourcer | M-ary symmetric channel crowdsourcing · N-ary crowdsourcing | minimum queries per item | Helped |
| Increase k in k-ary incidence coding | k-ary incidence coding · Binary labeling with SHC(q) | error probability lower bound | Helped |
| Increase hammer probability q | k-ary incidence coding · Binary labeling with SHC(q) | error probability lower bound | Helped |
Closest papers by meaning
- Optimality of Belief Propagation for Crowdsourced Classification (ICML 2016 · similarity 0.89)
- Achieving budget-optimality with adaptive schemes in crowdsourcing (NeurIPS 2016 · similarity 0.89)
- A Minimax Optimal Algorithm for Crowdsourcing (NeurIPS 2017 · similarity 0.87)
- KFNN: K-Free Nearest Neighbor For Crowdsourcing (NeurIPS 2024 · similarity 0.83)
- Efficient Online Crowdsourcing with Complex Annotations (AAAI 2024 · similarity 0.83)
- Evaluating LLM-contaminated Crowdsourcing Data Without Ground Truth (NeurIPS 2025 · similarity 0.83)
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.