Sample-efficient strategies for learning in the presence of noise

In this paper, we prove various results about PAC learning in the presence of malicious noise. Our main interest is the sample size behavior of learning algorithms. We prove the first nontrivial sample complexity lower bound in this model by showing that order of ε/Δ 2 + d /Δ (up to logarithmic factors) examples are necessary for PAC learning any target class of 0, 1-valued functions of VC dimension d, where ε is the desired accuracy and η = ε/ (1 + ε) - Δ the malicious noise rate (it is well known that any nontrivial target class cannot be PAC learned with accuracy ε and malicious noise rate η ≥ ε/ (1 + ε), this irrespective to sample complexity). We also show that this result cannot be significantly improved in general by presenting efficient learning algorithms for the class of all subsets of d elements and the class of unions of at most d intervals on the real line. This is especialy interesting as we can also show that the popular minimum disagreement strategy needs samples of size d ε/Δ 2, hence is not optimal with respect to sample size. We then discuss the use of randomized hypotheses. For these the bound ε/ (1 + ε) on the noise rate is no longer true and is replaced by 2ε/ (1 + 2ε). In fact, we present a generic algorithm using randomized hypotheses that can tolerate noise rates slightly larger than ε/ (1 + ε) while using samples of size d /ε as in the noise-free case. Again one observes a quadratic powerlaw (in this case d ε/Δ 2, Δ = 2ε/ (1 + 2ε) - η) as Δ goes to zero. We show upper and lower bounds of this order.