On learning parametric-output HMMs
Not on the map. Why?
Abstract (arXiv)
We present a novel approach for learning an HMM whose outputs are distributed according to a parametric family. This is done by em decoupling the learning task into two steps: first estimating the output parameters, and then estimating the hidden states transition probabilities. The first step is accomplished by fitting a mixture model to the output stationary distribution. Given the parameters of this mixture model, the second step is formulated as the solution of an easily solvable convex quadratic program. We provide an error analysis for the estimated transition probabilities and show they are robust to small perturbations in the estimates of the mixture parameters. Finally, we support our analysis with some encouraging empirical results.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Feb 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2020: 1; 2021: 0; 2022: 1; 2023: 1; 2024: 2.
5 papers.
- 2023Learning Hidden Markov Models Using Conditional Samplescited by 12
- 2020Provable Hierarchical Imitation Learning via EMcited by 10
- 2024Model Stealing for Any Low-Rank Language Modelcited by 9
- 2022Geometric Learning of Hidden Markov Models via a Method of Moments Algorithmcited by 2
- 2024Representation and De-interleaving of Mixtures of Hidden Markov Processescited by 0
- 2024Model Stealing for Any Low-Rank Language Model12 Nov 2024
- 2024Representation and De-interleaving of Mixtures of Hidden Markov Processes1 Jun 2024
- 2023Learning Hidden Markov Models Using Conditional Samples28 Feb 2023
- 2022Geometric Learning of Hidden Markov Models via a Method of Moments Algorithm2 Jul 2022
- 2020Provable Hierarchical Imitation Learning via EM7 Oct 2020