1090 articles – 599 Notices  [english version]
HAL : hal-00638388, version 1

Fiche détaillée  Récupérer au format
Versions disponibles :
Convergence of a Particle-based Approximation of the Block Online Expectation Maximization Algorithm
Sylvain Le Corff 1, Gersende Fort 1

Online variants of the Expectation Maximization 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. The convergence properties of the Block Online EM algorithm have been derived, even in general latent models such as the Hidden Markov one. These properties rely on the assumption that some intermediate quantities are available analytically. Unfortunately, this is not the case in hidden Markov models with general state-spaces. 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 are illustrated through Monte Carlo experiments.
1 :  Laboratoire Traitement et Communication de l'Information [Paris] (LTCI)
Télécom ParisTech – CNRS : UMR5141

Liste des fichiers attachés à ce document : 
lf_SMC_hal.pdf(742.2 KB)