EconPapers    
Economics at your fingertips  
 

Improving the vector $$\varepsilon $$ ε acceleration for the EM algorithm using a re-starting procedure

Masahiro Kuroda (), Zhi Geng and Michio Sakakihara

Computational Statistics, 2015, vol. 30, issue 4, 1077 pages

Abstract: The expectation–maximization (EM) algorithm is a popular algorithm for finding maximum likelihood estimates from incomplete data. However, the EM algorithm converges slowly when the proportion of missing data is large. Although many acceleration algorithms have been proposed, they require complex calculations. Kuroda and Sakakihara (Comput Stat Data Anal 51:1549–1561, 2006 ) developed the $$\varepsilon $$ ε -accelerated EM algorithm which only uses the sequence of estimates obtained by the EM algorithm to get an accelerated sequence for the EM sequence but does not change the original EM sequence. We find that the accelerated sequence often has larger values of the likelihood than the current estimate obtained by the EM algorithm. Thus, in this paper, we try to re-start the EM iterations using the accelerated sequence and then generate a new EM sequence that increases its speed of convergence. This algorithm has another advantage of simple implementation since it only uses the EM iterations and re-starts the iterations by an estimate with a larger likelihood. The re-starting algorithm called the $$\varepsilon $$ ε R-accelerated EM algorithm can further improve the EM algorithm and the $$\varepsilon $$ ε -accelerated EM algorithm in the sense of that it can reduces the number of iterations and computation time. Copyright Springer-Verlag Berlin Heidelberg 2015

Keywords: The vector $$\varepsilon $$ ε algorithm; The EM algorithm; Re-starting procedure; Acceleration of convergence (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s00180-015-0565-y (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: https://EconPapers.repec.org/RePEc:spr:compst:v:30:y:2015:i:4:p:1051-1077

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2

DOI: 10.1007/s00180-015-0565-y

Access Statistics for this article

Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik

More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:compst:v:30:y:2015:i:4:p:1051-1077