2000 character limit reached
Online learning of Riemannian hidden Markov models in homogeneous Hadamard spaces
Published 15 Feb 2021 in cs.LG, math.DG, and stat.CO | (2102.07771v3)
Abstract: Hidden Markov models with observations in a Euclidean space play an important role in signal and image processing. Previous work extending to models where observations lie in Riemannian manifolds based on the Baum-Welch algorithm suffered from high memory usage and slow speed. Here we present an algorithm that is online, more accurate, and offers dramatic improvements in speed and efficiency.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.