PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance [chapter]

Nick Palmer, Paul W. Goldberg
2005 Lecture Notes in Computer Science  
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the generation of strings of symbols, that have been used in the context of speech and handwriting recognition, and bioinformatics. Recent work on learning PDFAs from random examples has used the KL-divergence as the error measure; here we use the variation distance. We build on recent work by Clark and Thollard, and show
more » ... the use of the variation distance allows simplifications to be made to the algorithms, and also a strengthening of the results; in particular that using the variation distance, we obtain polynomial sample size bounds that are independent of the expected length of strings.
doi:10.1007/11564089_14 fatcat:elftebjq3bdxnngqqiidyfktum