Learn Before
Formula

Evidence Lower Bound (ELBO) Formula

The evidence lower bound (ELBO), denoted as L\mathcal{L}, is defined as: L(v,θ,q)=logp(v;θ)DKL(q(hv)p(hv;θ))\mathcal{L}(v,\theta,q)=\log p(v;\theta)-D_{KL} (q(h|v)||p(h|v;\theta)), where qq is an arbitrary probability distribution over latent variables hh, and vv represents observed variables. L\mathcal{L} always has at most the same value as the desired log-probability, since the difference between logp(v)\log p(v) and L(v,θ,q)\mathcal{L}(v,\theta,q) is given by the Kullback-Leibler (KL) divergence, which is always nonnegative. The two values are equal if and only if qq is the same distribution as the true posterior p(hv)p(h|v). L\mathcal{L} can be rearranged through algebra into the simpler form L(v,θ,q)=Ehq[logp(h,v)]+H(q)\mathcal{L}(v,\theta,q)=\mathbb{E}_{h\sim q}[\log p(h,v)]+H(q). Thus, we can think of inference as the procedure for finding the distribution qq that maximizes L\mathcal{L}.

0

1

Updated 2026-06-20

References


Tags

Data Science

Learn After