Applying EGD, we know that we can efficiently find the E-step optimum.
the EGDbased EM algorithm efficiently implements coordinate ascent onJ (θ, q), with each step monotonically increasingJ : Hence, we have shown that it is possible to efficiently use an arbitrary convex, differentiable function of the marginals, h(m), as a PR penalty function.