atlas

Research map / Learning theory and algorithms / Sample complexity

Active Learning from Imperfect Labelers

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds · 34 citations (OpenAlex)

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 abstention responses to guide binary search (adaptive test on abstention counts) instead of only 0/1 labelsthreshold learning with abstaining labeler · 1D thresholds, Condition 3 (abstention-only, monotone abstention)query complexity: removes the 1/eps^{2beta} factor, giving O~(1/f(eps/2)) instead of O~(1/f(eps/2) eps^{-2beta})Helped
Abstention-based test (CheckSignificant-Var) replaces 0/1-label test when abstention is strictly monotonethreshold search · 1D thresholdsquery complexityHelped
Plateau abstention rate near boundary (violating monotonicity condition) instead of strictly increasingthreshold search · 1D thresholds, P(abstain)=0.68 on [0.2,0.4]query complexityHurt
Lower bound for abstention-only vs noise-only labelers of equal corruptionthreshold learning · theoretical comparisonquery complexity exponent: abstention-only O~(eps^-gamma) vs noise-only O~(eps^-2gamma)Helped

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