Machine Learning, Statistics, Algorithms, Mathematics, Data Science.
lower bound for it: We find that the observed log-likelihood is lower bounded by the expected hidden log-likelihood and the expectation of the log of the arbitrary probability distribution q. So, in the E-step. What we are doing is maximising the lower bound with respect to q. This happens when