Abstract.
We consider a hidden Markov model with multidimensional observations, and with misspecification, i.e., the assumed coefficients (transition probability matrix and observation conditional densities) are possibly different from the true coefficients. Under mild assumptions on the coefficients of both the true and the assumed models, we prove that: (i) the prediction filter, and its gradient with respect to some parameter in the model, forget almost surely their initial condition exponentially fast, and (ii) the extended Markov chain, whose components are the unobserved Markov chain, the observation sequence, the prediction filter, and its gradient, is geometrically ergodic and has a unique invariant probability distribution.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Date received: May 14, 1998. Date revised: November 18, 1999.
Rights and permissions
About this article
Cite this article
Le Gland, F., Mevel, L. Exponential Forgetting and Geometric Ergodicity in Hidden Markov Models. Math. Control Signals Systems 13, 63–93 (2000). https://doi.org/10.1007/PL00009861
Issue Date:
DOI: https://doi.org/10.1007/PL00009861