Kullback Proximal Algorithms for Maximum Likelihood Estimation

Stéphane Chrétien 1 Alfred O. Hero 2
1 IS2 - Statistical Inference for Industry and Health
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive
Abstract : In this paper, we study the convergence of a new class of fast and stable sequential optimization methods for computing maximum likelihood estimates. These methods are based on a proximal point algorithm implemented with a Kullback-type proximal function. When the proximal regularization parameter is set to unity one obtains the classical expectation maximization (EM) algorithm. For other values of the regularization parameter, relaxed versions of EM are obtained which can have much faster convergence. In particular, if the regularization parameter vanishes at infinity, a superlinearly converging algorithm is obtained. We present an implementation of the algorithm using the trust region update strategy. For illustration the method is applied to a non-quadratic inverse problem with Poisson distributed data.
Type de document :
[Research Report] RR-3756, INRIA. 1999
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:14:53
Dernière modification le : jeudi 28 juin 2018 - 14:36:19
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:02:55



  • HAL Id : inria-00072906, version 1



Stéphane Chrétien, Alfred O. Hero. Kullback Proximal Algorithms for Maximum Likelihood Estimation. [Research Report] RR-3756, INRIA. 1999. 〈inria-00072906〉



Consultations de la notice


Téléchargements de fichiers