Save this video free

Stats 102C - Lecture 19 - Multivariate MCMC concepts

Miles Chen · 47:20 · Watch on YouTube

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Miles Chen extends Metropolis sampling from scalar values to vectors, using a bivariate normal target with correlation 0.8 to show how joint proposals can be rejected frequently and become inefficient in higher dimensions. He introduces Gibbs sampling as an alternative: update one coordinate at a time from its conditional distribution, which for this bivariate normal has variance 1 − 0.8² = 0.36 and requires no rejection step.

Key takeaways

Chapters

0:00 From Scalar Metropolis Sampling to Multivariate MCMC
5:00 Bivariate Normal Target and Symmetric Vector Proposals
12:00 Log-Density Acceptance Calculation for a Proposed Point
18:00 Proposal Scale Changes Metropolis Acceptance and Exploration
25:00 Why Joint Metropolis Proposals Degrade in High Dimensions
30:00 Gibbs Sampling Updates One Coordinate at a Time
37:00 Conditional Distributions for a Correlated Bivariate Normal
42:00 Gibbs Sampling’s Benefit and Conditional-Density Challenge
45:00 Why Exact Gibbs Conditional Draws Are Always Accepted

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:00 record. All right. Uh, good morning and happy Monday. I feel like I'm barely I had a rough morning this morning. Uh, but anyway, uh, I'm here and you guys are here and we're still learning MCMC and this is great. Okay. So, um we So, okay. Well, actually, I guess two weeks ago, last week you guys took the midterm and then it was also a holiday and then we just did like this deciphering thing which was kind of fun maybe. Um but then yeah I guess two weeks ago then we had the Metropolis uh algorithm metropolis Hastings and we

0:48 showed like oh okay um even if you don't know the full PDF if you have something proportional to it okay which is often very helpful in um the basian case uh or just like whenever the denominator is really hard to figure out that's okay you can use the metropolis algorithm and you can start at an arbitrary point. Doesn't even have to be good. And eventually it'll get to the right areas and then you can let it run and you'll get a sample. Okay. And we saw a few things like um so the properties of that metropolis markoff chain says that in the long run it's going to the sample you draw will look like the actual sample or actual

1:38 distribution will reflect that that's what it's uh the stationary distribution is equal to the target distribution. So theoretically that's what we should get. But at a practical level, if your proposal distribution isn't good in that like you're proposing too far away or you're proposing too close and you don't get the width quite right, um it takes a long time, uh it could take a really long time to get a a sample that works. Okay, that

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Miles Chen.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.