Answer
- log p(D) = log ∫ p(D, θ) dθ = log ∫ q(θ) * p(D, θ)/q(θ) dθ ≥ Eq[logp(D,θ)/q(θ)] (Jensen).
- ELBO = E_q[log p(D, θ)] - E_q[log q(θ)] = E_q[log p(D | θ)] - KL(q || p(θ)). log p(D)−ELBO=KL(q∣∣p(θ∣D)) ≥ 0 → maximizing ELBO minimizes KL to the posterior.
- Same objective drives VAE training in deep learning.
Check yourself — multiple choice
- Random
- ELBO=Eq[logp(D∣θ)]−KL(q∣∣prior); log p(D)−ELBO=KL(q∣∣posterior) ≥ 0 → maximizing ELBO minimizes KL to posterior; VAE loss too
- Same as log-lik
- Not real
ELBO=Eq[logp(D∣θ)]−KL(q∣∣prior); log p(D)−ELBO=KL(q∣∣posterior).
#bayesian#mcmc
Practise Statistics Fundamentals
215 interview questions in this topic.