Variance-Reduced Stochastic Optimization for Efficient Inference of Hidden Markov Models

Abstract

Hidden Markov models (HMMs) are popular models to identify a finite number of latent states from sequential data. However, fitting them to large data sets can be computationally demanding because most likelihood maximization techniques require iterating through the entire underlying data set for every parameter update. We propose a novel optimization algorithm that updates the parameters of an HMM without iterating through the entire data set. Namely, we combine a partial E step with variance-reduced stochastic optimization within the M step. We prove the algorithm converges under certain regularity conditions. We test our algorithm empirically using a simulation study as well as a case study of kinematic data collected using suction-cup attached biologgers from eight northern resident killer whales (Orcinus orca) off the western coast of Canada. In both, our algorithm converges in fewer epochs and to regions of higher likelihood compared to standard numerical optimization techniques. Our algorithm allows practitioners to fit complicated HMMs to large time-series data sets more efficiently than existing baselines.

arXiv comment23 pages, 7 figures. Code available at https://github.com/evsi8432/sublinear-HMM-inference

References in corpus (11)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
• Uncovering ecological state dynamics with hidden Markov models
• SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
• Hypothesis test for normal mixture models: The EM approach
• Why Random Reshuffling Beats Stochastic Gradient Descent
• SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient
• Second-Order Stochastic Optimization for Machine Learning in Linear Time
• An Alternative View: When Does SGD Escape Local Minima?
• On the Global Convergence of (Fast) Incremental Expectation Maximization Methods
• The conditionally autoregressive hidden Markov model (CarHMM): Inferring behavioural states from animal tracking data exhibiting conditional autocorrelation