
Evidence lower bound
8
MENTIONS
2
EPISODES
1
PODCASTS
Search complete. 8 mentions across 2 episodes found for "Evidence lower bound".
Oct 22, 2026
Stanford CS236: Deep Generative Models I 2023 I Lecture 16 - Score Based Diffusion Models
S
38:58Stefano ErmonHOST
It's not learnable.
S
39:00Stefano ErmonHOST
That's the usual ELBO objective.
S
39:02Stefano ErmonHOST
And recall that these decoders are parameterized, are all Gaussians.
S
39:07Stefano ErmonHOST
And they have this simple form, where to sample xt minus 1, you would take xt, you pass it through some neural network to get the mean, and then they will have fixed variance.
S
39:39Stefano ErmonHOST
But kind of like, if you parameterize the network in terms of an absolute network that takes Xt as an input.
S
39:47Stefano ErmonHOST
And then tries to predict the noise that was added to xt and subtracts it from, subtracts this estimated noise from xt to get a guess of what xt minus 1 should be.
S
40:03Stefano ErmonHOST
Then you can show that this ELBO objective is actually equivalent to the usual denoising score matching loss.
S
40:12Stefano ErmonHOST
So, Minimizing the negative elbow or maximizing the lower bound on the average plug likelihood is actually the same as trying to estimate the scores of these noise perturbed data distributions.
Stanford CS229 Machine Learning | Spring 2026 | Lecture 9: K-Means and GMM (non-EM)
C
2:12Chris RéHOST
Like one of my graduate students was just writing for his submission next week.
C
2:15Chris RéHOST
He's going to write what's called an ELBO.
C
2:17Chris RéHOST
If you don't know what an ELBO is, you'll learn soon for his particular diffusion style estimator.
C
2:22Chris RéHOST
Okay? Now, we're going to talk about k-means and its probabilistic analog GMM.
C
2:27Chris RéHOST
k-means is going to be hopefully intuitive to think about.