Skip to main content
Evidence lower bound

Evidence lower bound

Search complete. 8 mentions across 2 episodes found for "Evidence lower bound".

Oct 22, 2026

Stefano ErmonHOST
38:58
It's not learnable.
Stefano ErmonHOST
39:00
That's the usual ELBO objective.
Stefano ErmonHOST
39:02
And recall that these decoders are parameterized, are all Gaussians.
Stefano ErmonHOST
39:07
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.
Stefano ErmonHOST
39:39
But kind of like, if you parameterize the network in terms of an absolute network that takes Xt as an input.
Stefano ErmonHOST
39:47
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.
Stefano ErmonHOST
40:03
Then you can show that this ELBO objective is actually equivalent to the usual denoising score matching loss.
Stefano ErmonHOST
40:12
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.
Chris RéHOST
2:12
Like one of my graduate students was just writing for his submission next week.
Chris RéHOST
2:15
He's going to write what's called an ELBO.
Chris RéHOST
2:17
If you don't know what an ELBO is, you'll learn soon for his particular diffusion style estimator.
Chris RéHOST
2:22
Okay? Now, we're going to talk about k-means and its probabilistic analog GMM.
Chris RéHOST
2:27
k-means is going to be hopefully intuitive to think about.

We value your privacy

We use cookies to understand how you use our platform and to improve your experience. Click “Accept All” to consent, or “Decline non-essential” to opt out of non-essential cookies. Read our Privacy Policy.