Time discretization of continuous-time filters and smoothers for HMM parameter estimation

TitleTime discretization of continuous-time filters and smoothers for HMM parameter estimation
Publication TypeJournal Article
Year of Publication1996
AuthorsJames, M. R., V. Krishnamurthy, and F. Le Gland
JournalInformation Theory, IEEE Transactions on
Volume42
Pagination593 -605
Date Publishedmar.
ISSN0018-9448
KeywordsAlgorithms, Baum-Welch re-estimation equations, computational complexity, computer simulations, continuous time filters, continuous-time filters, continuous-time hidden Markov models, continuous-time smoothers, difference equations, discrete time filters, discretization error, fast-sampled homogeneous Markov chains, fixed-interval smoothing algorithm, forward-backward algorithm, Gaussian noise, hidden Markov models, HMM parameter estimation, parallel implementation, parameter estimation, robust discretization, smoothing methods, stochastic differential equations, time discretization, two-sided stochastic integrals, white Gaussian noise, white noise
Abstract

In this paper we propose algorithms for parameter estimation of fast-sampled homogeneous Markov chains observed in white Gaussian noise. Our algorithms are obtained by the robust discretization of stochastic differential equations involved in the estimation of continuous-time hidden Markov models (HMM's) via the EM algorithm. We present two algorithms: the first is based on the robust discretization of continuous-time filters that were recently obtained by Elliott to estimate quantities used in the EM algorithm; the second is based on the discretization of continuous-time smoothers, yielding essentially the well-known Baum-Welch re-estimation equations. The smoothing formulas for continuous-time HMM's are new, and their derivation involves two-sided stochastic integrals. The choice of discretization results in equations which are identical to those obtained by deriving the results directly in discrete time. The filter-based EM algorithm has negligible memory requirements; indeed, independent of the number of observations. In comparison the smoother-based discrete-time EM algorithm requires the use of the forward-backward algorithm, which is a fixed-interval smoothing algorithm and has memory requirements proportional to the number of observations. On the other hand, the computational complexity of the filter-based EM algorithm is greater than that of the smoother-based scheme. However, the filters may be suitable for parallel implementation. Using computer simulations we compare the smoother-based and filter-based EM algorithms for HMM estimation. We provide also estimates for the discretization error

URLhttp://dx.doi.org/10.1109/18.485727
DOI10.1109/18.485727

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia