Machine Learning, Statistics, Algorithms, Mathematics, Data Science.
In the M-step, we maximise the lower bound with respect to (θ, λ). Since the second term is constant with respect to (θ, λ), we get In the M-step we maximise w.r.t (θ, λ) Since we can write the hidden log-likelihood as follows: and since Z has been set to be equal to the responsibility in the