Learning Fallible Deterministic Finite Automata

Authors:
Dana Ron;Ronitt Rubinfeld
Affiliations:
Computer Science Institute, Hebrew University, Jerusalem 91904, Israel. danar@cs.huji.ac.il;Computer Science Department, Cornell University, Ithaca, NY 14853, U.S.A. ronitt@cs.cornell.edu
Venue:
Machine Learning - Special issue on COLT '93
Year:
1995

Citing 0
Cited 6

Exactly Learning Automata of Small Cover Time

Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Malicious Omissions and Errors in Answers to Membership Queries

Machine Learning
Probabilistic Finite-State Machines-Part I

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning with errors in answers to membership queries

Journal of Computer and System Sciences
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms

Pattern Recognition
Learning models of intelligent agents

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 fixed probability strictly smaller than ½, and are persistent. In particular, we present a polynomial time algorithm using membership queries for correcting and learning fallible Deterministic Finite Automata under the uniform distribution.