Fast inference and learning in large-state-space HMMs

For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optimal state sequence for the observations, and learning the model parameters, all have quadratic time complexity in the number of states. We introduce a novel class of non-sparse Markov transition matrices called Dense-Mostly-Constant (DMC) transition matrices that allow us to derive new algorithms for solving the basic HMM problems in sub-quadratic time. We describe the DMC HMM model and algorithms and attempt to convey some intuition for their usage. Empirical results for these algorithms show dramatic speedups for all three problems. In terms of accuracy, the DMC model yields strong results and outperforms the baseline algorithms even in domains known to violate the DMC assumption.

• Type: Conference
• Year: 2005
• Where: ICML
• Authors: Sajid M. Siddiqi, Andrew W. Moore
• Keywords: DMC HMM Model, DMC Model Yields, ICML 2005, Machine Learning, Markov Transition Matrices