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.
[1] Ming Li,et al. Learning in the presence of malicious errors , 1993, STOC '88.
[2] Dana Angluin. Equivalence queries and approximate fingerprints , 1989, COLT '89.
[3] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[4] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[5] Yasubumi Sakakibara,et al. Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.