Learning fallible finite state automata

We consider the problem of learning from a fallible expert that answers all queries about a concept, but often gives incorrect answers. The expert can also be thought of as a truth table describing the concept which has been partially corrupted. In order to learn the underlying concept with arbitrarily high precision, we would like to use its structure in order to correct most of the incorrect answers. We assume that the expert’s errors are uniformly and independently distributed, occur with any probability strictly smaller than ~, and are persistent. In particular, we present a polynomial time algorithm using membership queries for correcting and learning fallible DFA’s under the uniform distribution.

[1]  Leslie G. Valiant,et al.  Learning Disjunction of Conjunctions , 1985, IJCAI.

[2]  Leslie G. Valiant,et al.  Cryptographic limitations on learning Boolean formulae and finite automata , 1994, JACM.

[3]  Ming Li,et al.  Learning in the presence of malicious errors , 1993, STOC '88.

[4]  Rani Siromoney,et al.  A noise model on learning sets of strings , 1992, COLT '92.

[5]  Ronald L. Rivest,et al.  Diversity-based inference of finite automata , 1994, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

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

[8]  Donna K. Slonim,et al.  Learning Monotone DNF with an Incomplete Membership Oracle , 1991, COLT.

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

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

[11]  Robert H. Sloan,et al.  Corrigendum to types of noise in data for concept learning , 1988, COLT '92.

[12]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[13]  Ronitt Rubinfeld,et al.  Efficient learning of typical finite automata from random walks , 1993, STOC.

[14]  Michael Kearns,et al.  Efficient noise-tolerant learning from statistical queries , 1993, STOC.

[15]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[16]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[17]  George Shackelford,et al.  Learning k-DNF with noise in the attributes , 1988, Annual Conference Computational Learning Theory.