Α-EM algorithm ( Maximum Likelihood Parameters)

Time Complexity

$O(n^{3})$

Space Complexity

$O(n+r)$? words

(Stores current theta and Z guesses, which is updated each iteration. Also assumes description of alpha-log-likelihood takes O(n+r) auxiliary space.)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

2003

Reference

https://dl.acm.org/doi/10.1109/TIT.2002.808105