Abstract
The Expectation-Maximization (EM) algorithm is a very popular technique for maximum likelihood estimation in incomplete data models. When the expectation step cannot be performed in closed form, a stochastic approximation of EM (SAEM) can be used. Under very general conditions, the authors have shown that the attractive stationary points of the SAEM algorithm correspond to the global and local maxima of the observed likelihood. In order to avoid convergence towards a local maxima, a simulated annealing version of SAEM is proposed. An illustrative application to the convolution model for estimating the coefficients of the filter is given.
| Original language | English |
|---|---|
| Pages (from-to) | 229-236 |
| Number of pages | 8 |
| Journal | Statistics and Computing |
| Volume | 7 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Jan 1997 |
Keywords
- Deconvolution
- EM algorithm
- Linear filters
- Simulated annealing
- Stochastic algorithms
Fingerprint
Dive into the research topics of 'A simulated annealing version of the EM algorithm for non-Gaussian deconvolution'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver