Research map / Learning theory and algorithms / Prediction and decision losses
Achieving budget-optimality with adaptive schemes in 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 |
|---|---|---|---|
| Use adaptive task assignment instead of non-adaptive assignment | Spectral crowdsourcing inference · Synthetic, λ=1/7 | queries per task for error 0.002: 360 -> 180 | Helped |
| Use adaptive instead of non-adaptive on harder mix (λ=4/13) | Spectral crowdsourcing inference · Synthetic, λ=4/13 | query gap ratio: 13/64 | Helped |
| Use adaptive scheme instead of majority voting | Spectral crowdsourcing inference · Synthetic | error rate | Helped |
Closest papers by meaning
- Fundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing (NeurIPS 2016 · similarity 0.89)
- A Minimax Optimal Algorithm for Crowdsourcing (NeurIPS 2017 · similarity 0.87)
- Analysis of Minimax Error Rate for Crowdsourcing and Its Application to Worker Clustering Model (ICML 2018 · similarity 0.86)
- Exact Exponent in Optimal Rates for Crowdsourcing (ICML 2016 · similarity 0.86)
- Recovering Top-Two Answers and Confusion Probability in Multi-Choice Crowdsourcing (ICML 2023 · similarity 0.86)
- Peer Neighborhood Mechanisms: A Framework for Mechanism Generalization (AAAI 2024 · 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.