Accelerating the convergence of the EM algorithm using the vector ε algorithm

Authors:
Masahiro Kuroda;Michio Sakakihara
Affiliations:
Department of Socio-Information, Okayama University of Science, 1-1 Ridaicho, Okayama, Japan;Department of Information Science, Okayama University of Science, 1-1 Ridaicho, Okayama, Japan
Venue:
Computational Statistics & Data Analysis
Year:
2006

Citing 0
Cited 6

Global and componentwise extrapolations for accelerating training of Bayesian networks and conditional random fields

Data Mining and Knowledge Discovery
Acceleration of the EM algorithm via extrapolation methods: Review, comparison and new methods

Computational Statistics & Data Analysis
Acceleration of the alternating least squares algorithm for principal components analysis

Computational Statistics & Data Analysis
Semi-supervised Bayesian ARTMAP

Applied Intelligence
Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter

Computational Statistics & Data Analysis
Acceleration of the EM algorithm: P-EM versus epsilon algorithm

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.03

Visualization

Abstract

The EM algorithm of Dempster, Laird and Rubin [1977. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B 39, 1-22] is a very general and popular iterative computational algorithm that is used to find maximum likelihood estimates from incomplete data and is widely used to perform statistical analysis with missing data, because of its stability, flexibility and simplicity. However, a common criticism is that the convergence of the EM algorithm is slow. Various algorithms to accelerate the convergence of the EM algorithm have been proposed. In this paper, we propose the ''@e-accelerated EM algorithm'' that speeds up the convergence of the EM sequence via the vector @e algorithm of Wynn [1962. Acceleration techniques for iterated vector and matrix problems. Math. Comp. 16, 301-322]. We also demonstrate its theoretical properties. The @e-accelerated EM algorithm has been successfully extended to the EM algorithm without affecting its stability, flexibility and simplicity. Numerical experiments illustrate the potential of the @e-accelerated EM algorithm.