On-line expectation-maximization algorithm for latent data models

Olivier Cappé and Eric Moulines

Journal Of The Royal Statistical Society Series B, 2009, vol. 71, issue 3, pages 593-613

Abstract: We propose a generic on-line (also sometimes called adaptive or recursive) version of the expectation-maximization (EM) algorithm applicable to latent variable models of independent observations. Compared with the algorithm of Titterington, this approach is more directly connected to the usual EM algorithm and does not rely on integration with respect to the complete-data distribution. The resulting algorithm is usually simpler and is shown to achieve convergence to the stationary points of the Kullback-Leibler divergence between the marginal distribution of the observation and the model distribution at the optimal rate, i.e. that of the maximum likelihood estimator. In addition, the approach proposed is also suitable for conditional (or regression) models, as illustrated in the case of the mixture of linear regressions model. Copyright (c) 2009 Royal Statistical Society.

Date: 2009

Downloads: (external link)
http://www.blackwell-synergy.com/doi/abs/10.1111/j.1467-9868.2009.00698.x link to full text (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:bla:jorssb:v:71:y:2009:i:3:p:593-613

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=1369-7412

Access Statistics for this article

Journal Of The Royal Statistical Society Series B is edited by C. Robert and A. T. A. Wood

More articles in Journal Of The Royal Statistical Society Series B from Royal Statistical Society
Series data maintained by Christopher F. Baum ().