MLE for partially observed diffusions: direct maximization vs. the em algorithm
Two algorithms are compared for maximizing the likelihood function associated with parameter estimation in partially observed diffusion processes: - - the EM algorithm, investigated by Dembo and Zeitouni (1986), an iterative algorithm where, at each iteration, an auxiliary function is computed and maximized; - - the direct approach where the likelihood function itself is computed and maximized. This yields to a comparison of nonlinear smoothing and nonlinear filtering for computing a class of conditional expectations related to the problem of estimation. In particular, it is shown that smoothing is indeed necessary for the EM algorithm approach to be efficient. Time discretization schemes for the stochastic PDE's involved in the algorithms are given, and the link with the discrete time case (hidden Markov model) is explored. Numerical results are presented with the conclusion that direct maximization should be preferred whenever some noise covariances associated with the parameters to be estimated are small.
Year of publication: |
1989
|
---|---|
Authors: | Campillo, Fabien ; Le Gland, François |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 33.1989, 2, p. 245-274
|
Publisher: |
Elsevier |
Keywords: | parameter estimation maximum likelihood EM algorithm diffusion processes nonlinear filtering nonlinear smoothing Skorokhod integral time discretization |
Saved in:
Saved in favorites
Similar items by person
-
Sampling per mode for rare event simulation in switching diffusions
Krystul, Jaroslav, (2012)
-
Parallel and interacting Markov chain Monte Carlo algorithm
Campillo, Fabien, (2009)
-
Approximation of the Fokker–Planck equation of the stochastic chemostat
Campillo, Fabien, (2014)
- More ...