Geometric Learning of Hidden Markov Models via a Method of Moments Algorithm
Chen, Berlin, Mostajeran, Cyrus, Said, Salem
–arXiv.org Artificial Intelligence
We present a novel algorithm for learning the parameters of hidden Markov models (HMMs) in a geometric setting where the observations take values in Riemannian manifolds. In particular, we elevate a recent second-order method of moments algorithm that incorporates non-consecutive correlations to a more general setting where observations take place in a Riemannian symmetric space of non-positive curvature and the observation likelihoods are Riemannian Gaussians. The resulting algorithm decouples into a Riemannian Gaussian mixture model estimation algorithm followed by a sequence of convex optimization procedures. We demonstrate through examples that the learner can result in significantly improved speed and numerical accuracy compared to existing learners.
arXiv.org Artificial Intelligence
Jul-2-2022
- Country:
- North America > United States (0.04)
- Asia > Singapore (0.04)
- Europe
- United Kingdom
- Scotland > City of Edinburgh
- Edinburgh (0.04)
- England > Cambridgeshire
- Cambridge (0.28)
- Scotland > City of Edinburgh
- France
- Île-de-France > Paris
- Paris (0.04)
- Auvergne-Rhône-Alpes > Isère
- Grenoble (0.04)
- Île-de-France > Paris
- United Kingdom
- Genre:
- Research Report (0.50)
- Workflow (0.46)
- Industry:
- Health & Medicine (0.93)
- Technology: