28 search results - page 1 / 6 » A Lower Bound for Learning Distributions Generated by Probab... |
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 1 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
COLT
1994
Springer
13 years 9 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
COLT
1995
Springer
13 years 8 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...