Learn Before
Jensen's Inequality
Jensen's inequality, named after the Danish mathematician Johan Jensen, relates the value of a convex function of an integral to the integral of the convex function. It was proved by Jensen in 1906. Jensen's inequality generalizes the statement that the secant line of a convex function lies above the graph of the function, which is Jensen's inequality for two points: the secant line consists of weighted means of the convex function. For t belongs to [0,1], there exists:
0
3
Tags
Data Science
Related
Application Scenarios of Using EM Algorithm
Jensen's Inequality
Why is it hard to approximate latent variables?
The relationship between EM algorithm with Jensen's Inequality
The Coin Example of EM Algorithm
The student example of EM algorithm
Convergence of EM Algorithm
Global Optimum of EM Algorithm
A Helpful Presentation Explaining mathematical Details and Applications of EM Algorithm Provided by Berkeley
A Coordinate Ascent View of Understanding EM Algorithm
E Step
M step