A Lower Bound for Learning Distributions Generated by Probabilistic Automata

14 years 2 months ago

Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability

Borja Balle, Jorge Castro, Ricard Gavaldà

Algorithm | ALT 2010 | Machine Learning | Queries Termed L-queries | Statistical Queries |

claim paper

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	ALT
Authors	Borja Balle, Jorge Castro, Ricard Gavaldà

Comments (0)