On learning from queries and counterexamples in the presence of noise

Abstract

Recently Angluin and Laird have introduced the classification noise process in the Valiant learnability model and proposed an interesting problem to explore the effect of noise in a situation that calls for queries as well as random sampling. In this paper, we present a general method to modify a polynomial-time learning algorithm from a sampling oracle and membership queries to compensate for random errors in the sampling and query responses.