mlsanityData to 7 Oct 2026

Active Learning from Imperfect Labelers

arXiv 1610.09730 ↗First posted 30 Oct 2016cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

We study active learning where the labeler can not only return incorrect labels but also abstain from labeling. We consider different noise and abstention conditions of the labeler. We propose an algorithm which utilizes abstention responses, and analyze its statistical consistency and query complexity under fairly natural assumptions on the noise and abstention rate of the labeler. This algorithm is adaptive in a sense that it can automatically request less queries with a more informed or less noisy labeler. We couple our algorithm with lower bounds to show that under some technical conditions, it achieves nearly optimal query complexity.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Oct 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 1; 2023: 6; 2024: 1; 2025: 1; 2026: 1.

13 papers.

Sort: