𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domains of convergence for the EM algorithm: a cautionary tale in a location estimation problem

✍ Scribed by Olcay Arslan; Patrick D. L. Constable; John T. Kent


Publisher
Springer US
Year
1993
Tongue
English
Weight
449 KB
Volume
3
Category
Article
ISSN
0960-3174

No coin nor oath required. For personal study only.

✦ Synopsis


The EM algorithm is a popular method for maximizing a likelihood in the presence of incomplete data. When the likelihood has multiple local maxima, the parameter space can be partitioned into domains of convergence, one for each local maximum. In this paper we investigate these domains for the location family generated by the t-distribution. We show that, perhaps somewhat surprisingly, these domains need not be connected sets. As an extreme case we give an example of a domain which consists of an infinite union of disjoint open intervals. Thus the convergence behaviour of the EM algorithm can be quite sensitive to the starting point.


πŸ“œ SIMILAR VOLUMES


A comparison of a mixture likelihood met
✍ Hojin Moon; Hongshik Ahn; Ralph L. Kodell; Bruce A. Pearce πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 226 KB

Both a mixture likelihood method and the EM algorithm are implemented to estimate the time-toonset-of and the time-to-death-from the tumor of interest in animal carcinogenicity studies. Both methods are implemented using Box's Complex Method for ΓΏnding the maximum likelihood estimates of parameters