论文信息 - Learning with malicious membership queries and exceptions (extended abstract)

Learning with malicious membership queries and exceptions (extended abstract)

We consider two issues in polynomial-time exact learning of concepts using membership and equivalence queries: (1) malicious errors in the answers to membership queries and (2) learning finite variants of concepts drawn from a learnable class.

Dana Angluin | Martins Krikis | D. Angluin | Martins Krikis

[1] Yu. I. Zhuravlev,et al. REALIZATION OF BOOLEAN FUNCTIONS WITH A SMALL NUMBER OF ZEROS BY DISJUNCTIVE NORMAL FORMS, AND RELATED PROBLEMS , 1985 .

[2] György Turán,et al. Learning with queries but incomplete information (extended abstract) , 1994, COLT '94.

[3] Robert E. Schapire,et al. Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions , 1993, SIAM J. Comput..

[4] Leslie Pack Kaelbling,et al. Inferring finite automata with stochastic output functions and an application to map learning , 1992, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5] Yasubumi Sakakibara,et al. On Learning from Queries and Counterexamples in the Presence of Noise , 1991, Inf. Process. Lett..

[6] Nader H. Bshouty,et al. Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[7] Ronitt Rubinfeld,et al. Learning fallible finite state automata , 1993, COLT '93.

[8] Leonard Pitt,et al. On the Necessity of Occam Algorithms , 1992, Theor. Comput. Sci..

[9] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[10] Sally A. Goldman,et al. Learning k-term DNF formulas with an incomplete membership oracle , 1992, COLT '92.