Identifiability conditions for partially-observed Markov chains
Duration: 36 mins 45 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Douc, R (Telecom SudParis)
Wednesday 23 April 2014, 15:50-16:25 |
---|
Created: | 2014-04-25 13:59 |
---|---|
Collection: | Advanced Monte Carlo Methods for Complex Inference Problems |
Publisher: | Isaac Newton Institute |
Copyright: | Douc, R |
Language: | eng (English) |
Abstract: | Co-authors: François ROUEFF (LTCI, UMR 5141, Telecom Paristech, France), Tepmony SIM (LTCI, UMR 5141, Telecom Paristech, France)
This paper deals with a parametrized family of partially-observed bivariate Markov chains. We establish that the limit of the normalized log-likelihood is maximized when the parameter belongs to the equivalence class of the true parameter, which is a key feature for obtaining consistency of the Maximum Likelihood Estimators in well-specified models. A novel aspect of this work is that geometric ergodicity of the Markov chain associated to the complete data, or exponential separation on measures are no more needed provided that the invariant distribution is assumed to be unique, regardless its rate of convergence to the equilibrium. The result is presented in a general framework including both fully dominated or partially dominated models as Hidden Markov models or Observation-Driven times series of counts. |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 534.89 MB | View | Download | |
WebM | 640x360 | 438.29 kbits/sec | 118.03 MB | View | Download | |
iPod Video | 480x270 | 522.04 kbits/sec | 140.52 MB | View | Download | |
MP3 | 44100 Hz | 249.79 kbits/sec | 67.30 MB | Listen | Download | |
Auto * | (Allows browser to choose a format it supports) |