Search

Try a topic

Notebook

Jensen's Inequality

Derivation ML theory

For convex f: E[f(X)]≥f(E[X])\mathbb{E}[f(X)] \geq f(\mathbb{E}[X]). For concave f (e.g., log): E[f(X)]≤f(E[X])\mathbb{E}[f(X)] \leq f(\mathbb{E}[X]).

Why it matters: Whole derivation of ELBO / variational inference starts here. Also why log⁡E[⋅]\log \mathbb{E}[\cdot] and E[log⁡⋅]\mathbb{E}[\log \cdot] aren’t interchangeable — they differ by the KL to the variational posterior.