On the Computational Complexity of Approximating Distributions by Probabilistic Automata.
Naoki AbeManfred K. WarmuthPublished in: Mach. Learn. (1992)
Keyphrases
- probabilistic automata
- computational complexity
- finite automata
- relative entropy
- markov chain
- probability distribution
- finite state automata
- kullback leibler divergence
- special case
- sound theoretical
- decision problems
- kl divergence
- random variables
- worst case
- dynamic programming
- gaussian distribution
- grammatical inference
- integrity constraints
- graphical models