Geometric Learning of Hidden Markov Models via a Method of Moments Algorithm

Abstract

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.

References in corpus (8)

• Poincaré Embeddings for Learning Hierarchical Representations
• Geomstats: A Python Package for Riemannian Geometry in Machine Learning
• A Method of Moments for Mixture Models and Hidden Markov Models
• Belief Propagation as Diffusion
• Frobenius statistical manifolds & geometric invariants
• Gaussian distributions on Riemannian symmetric spaces, random matrices, and planar Feynman diagrams
• Riemannian statistics meets random matrix theory: towards learning from high-dimensional covariance matrices
• Riemannian Gaussian distributions, random matrix ensembles and diffusion kernels