Convergence of a Particle-based Approximation of the Block Online Expectation Maximization Algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Modeling and Computer Simulation Année : 2013

Convergence of a Particle-based Approximation of the Block Online Expectation Maximization Algorithm

Résumé

Online variants of the Expectation Maximization (EM) algorithm have recently been proposed to perform parameter inference with large data sets or data streams, in independent latent models and in hidden Markov models. Nevertheless, the convergence properties of these algorithms remain an open problem at least in the hidden Markov case. This contribution deals with a new online EM algorithm which updates the parameter at some deterministic times. Some convergence results have been derived even in general latent models such as hidden Markov models. These properties rely on the assumption that some intermediate quantities are available in closed form or can be approximated by Monte Carlo methods when the Monte Carlo error vanishes rapidly enough. In this paper, we propose an algorithm which approximates these quantities using Sequential Monte Carlo methods. The convergence of this algorithm and of an averaged version is established and their performance is illustrated through Monte Carlo experiments.
Fichier principal
Vignette du fichier
lf_SMC_hal_rev3.pdf (638.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00638388 , version 1 (04-11-2011)
hal-00638388 , version 2 (24-02-2012)
hal-00638388 , version 3 (29-05-2012)

Identifiants

Citer

Sylvain Le Corff, Gersende Fort. Convergence of a Particle-based Approximation of the Block Online Expectation Maximization Algorithm. ACM Transactions on Modeling and Computer Simulation, 2013, 23 (1). ⟨hal-00638388v3⟩
119 Consultations
201 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More