Crowdsourced PAC Learning under Classification Noise
Not on the map. Why?
Abstract (arXiv)
In this paper, we analyze PAC learnability from labels produced by crowdsourcing. In our setting, unlabeled examples are drawn from a distribution and labels are crowdsourced from workers who operate under classification noise, each with their own noise parameter. We develop an end-to-end crowdsourced PAC learning algorithm that takes unlabeled data points as input and outputs a trained classifier. Our three-step algorithm incorporates majority voting, pure-exploration bandits, and noisy-PAC learning. We prove several guarantees on the number of tasks labeled by workers for PAC learning in this setting and show that our algorithm improves upon the baseline by reducing the total number of tasks given to workers. We demonstrate the robustness of our algorithm by exploring its application to additional realistic crowdsourcing settings.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.