Assess convergence of an EM algorithm.

Share:

Description

This function assesses convergence of the EM algorithm using Aitken's acceleration method, when fitting a PPCA based model.

Usage

1
Aitken(ll, lla, v, q, epsilon)

Arguments

ll

A vector of log likelihoods from the current and previous iterations.

lla

A vector containing the asympototic estimates of the maximized log likelihoods from the current and previous iterations.

v

Iteration number.

q

The dimension of the latent principal subspace for the PPCA based model currently being fitted.

epsilon

The value on which convergence of the EM algorithm is based.

Details

This function assesses convergence of the EM algorithm using Aitken's acceleration method in which an estimate of the maximized log likelihood at each iteration is evaluated. Convergence is achieved when the absolute difference between contiguous estimates, tol, is less than some user defined level, epsilon.

Value

A list containing:

tol

The absolute difference between contiguous estimates of the asymptotic maximized log likelihood.

la

The asymptotic estimate of the maximized log likelihood at the current iteration.

Note

This is used internally in functions which fit PPCA based models via the EM algorithm within the package MetabolAnalyze.

Author(s)

Nyamundanda Gift, Isobel Claire Gormley and Lorraine Brennan

References

McLachlan, G.J. and Krishnan, T. (1997) The EM algorithm and Extensions. Wiley, New York.

See Also

ppca.metabol, ppcca.metabol, mppca.metabol

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.