On the computational complexity of approximating distributions by probabilistic automata (Q1207305)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of approximating distributions by probabilistic automata |
scientific article; zbMATH DE number 149484
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of approximating distributions by probabilistic automata |
scientific article; zbMATH DE number 149484 |
Statements
On the computational complexity of approximating distributions by probabilistic automata (English)
0 references
1 April 1993
0 references
PAC learning model
0 references
density estimation
0 references
Kullback-Leibler divergence
0 references
hidden Markov models
0 references
speech recognition
0 references
computational learning theory
0 references
0.92310673
0 references
0 references
0.90905815
0 references
0.90688205
0 references
0.9051763
0 references
