Exponential forgetting and geometric ergodicity in hidden Markov models - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Mathematics of Control, Signals, and Systems Année : 2000

Exponential forgetting and geometric ergodicity in hidden Markov models

Laurent Mevel

Résumé

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.

Dates et versions

hal-00912073 , version 1 (01-12-2013)

Identifiants

Citer

François Le Gland, Laurent Mevel. Exponential forgetting and geometric ergodicity in hidden Markov models. Mathematics of Control, Signals, and Systems, 2000, 13 (1), pp.63-93. ⟨10.1007/PL00009861⟩. ⟨hal-00912073⟩
83 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More