A lower bound for learning distributions generated by probabilistic automata
From MaRDI portal
Recommendations
- Learning probabilistic automata: a study in state distinguishability
- scientific article; zbMATH DE number 5957212
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Algorithmic Learning Theory
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Cited in
(12)- Learning probabilistic automata and Markov chains via queries
- On the learnability and usage of acyclic probabilistic finite automata
- Generalization bounds for learning weighted automata
- Learning probabilistic automata: a study in state distinguishability
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Adaptively learning probabilistic deterministic automata from data streams
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- On conditional optimality of a class of learning automata in random environments
This page was built for publication: A lower bound for learning distributions generated by probabilistic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930698)
