DeepAI AI Chat
Log In Sign Up

Reduced-Rank Hidden Markov Models

10/06/2009
by   Sajid M. Siddiqi, et al.
Carnegie Mellon University
0

We introduce the Reduced-Rank Hidden Markov Model (RR-HMM), a generalization of HMMs that can model smooth state evolution as in Linear Dynamical Systems (LDSs) as well as non-log-concave predictive distributions as in continuous-observation HMMs. RR-HMMs assume an m-dimensional latent state and n discrete observations, with a transition matrix of rank k <= m. This implies the dynamics evolve in a k-dimensional subspace, while the shape of the set of predictive distributions is determined by m. Latent state belief is represented with a k-dimensional state vector and inference is carried out entirely in R^k, making RR-HMMs as computationally efficient as k-state HMMs yet more expressive. To learn RR-HMMs, we relax the assumptions of a recently proposed spectral learning algorithm for HMMs (Hsu, Kakade and Zhang 2009) and apply it to learn k-dimensional observable representations of rank-k RR-HMMs. The algorithm is consistent and free of local optima, and we extend its performance guarantees to cover the RR-HMM case. We show how this algorithm can be used in conjunction with a kernel density estimator to efficiently model high-dimensional multivariate continuous data. We also relax the assumption that single observations are sufficient to disambiguate state, and extend the algorithm accordingly. Experiments on synthetic data and a toy video, as well as on a difficult robot vision modeling problem, yield accurate models that compare favorably with standard alternatives in simulation quality and prediction capability.

READ FULL TEXT

page 9

page 10

11/23/2020

Learning Hidden Markov Models from Aggregate Observations

In this paper, we propose an algorithm for estimating the parameters of ...
07/04/2012

Predictive Linear-Gaussian Models of Stochastic Dynamical Systems

Models of dynamical systems based on predictive state representations (P...
01/08/2022

Low-Rank Constraints for Fast Inference in Structured Models

Structured distributions, i.e. distributions over combinatorial spaces, ...
07/24/2021

Inference of collective Gaussian hidden Markov models

We consider inference problems for a class of continuous state collectiv...
02/28/2023

Learning Hidden Markov Models Using Conditional Samples

This paper is concerned with the computational complexity of learning th...
09/04/2016

Spectral learning of dynamic systems from nonequilibrium data

Observable operator models (OOMs) and related models are one of the most...