Machine Learning, Data Science, Statistics, Probability, Editors Pick.
the EM algorithm. First, the complete log-likelihood P(X|Z,θ) is faster to maximize than the log likelihood P(X,Z|θ) because there is no marginalization over Z. However, this introduces a problem because we don’t know Z. Therefore, the second intuition is that we can instead maximize Q(θ,θ*) or the