Save this video free

STAT 638 (Fall 2026), Lecture 26

Samiran Sinha · 51:01 · Watch on YouTube

STAT 638 (Fall 2026), Lecture 26 Watch on YouTube →

Overview

Samiran Sinha reviews collapsed Gibbs sampling as an option for reducing MCMC autocorrelation, then develops Bayesian count regression using Poisson, zero-inflated Poisson, negative binomial, and zero-inflated negative binomial models. Using an extramarital-affairs dataset and R's brms package, he explains log links, coefficient interpretation, marginal effects, model comparison by log marginal likelihood, and posterior predictive checks.

Key takeaways

Chapters

0:00 Collapsed Gibbs Sampling and MCMC Autocorrelation
7:55 Poisson Regression: Log Link, Likelihood, and Count Outcomes
13:37 Affairs Data and Writing the Model in brms
19:26 Poisson Model Priors, Diagnostics, and Coefficient Interpretation
24:20 Marginal Effects and Bayesian Model Comparison
30:52 Checking Poisson Fit with Zero Counts and Tail Probabilities
34:14 Zero-Inflated Poisson Regression for Excess Zeros
38:48 Negative Binomial Regression and Overdispersed Counts
43:34 Zero-Inflated Negative Binomial and Comparing Four Models
47:46 Posterior Predictive Checks for Count-Model Fit

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

Transcript excerpt

0:01 Sinha, Samiran: So today, we will talk about the last part of Chapter 10, which is MCMC methods, and then we will talk about some problems of generalized linear model. Sinha, Samiran: All right. So, MCMC techniques is a very broad technique, and in this lecture, in this class, we are getting some glimpses of these MCMC methods. Sinha, Samiran: I talked about The general metropolis strings technique. Sinha, Samiran: Metropolis H strings algorithm. Sinha, Samiran: And then we talked about Sinha, Samiran: High correlation among the observation sample values. Sinha, Samiran: And to reduce high correlations, there is no optimal or unique technique, There are different techniques.

1:01 Sinha, Samiran: And we need to try out those techniques and see which one works. Sinha, Samiran: One of them… is block sampling, we talked. And the other one we started is about co-op sampling. Sinha, Samiran: So, in the co-op sampling, in the Gibb sampling, what happens? We sample each parameter. Sinha, Samiran: From its full conditional distribution. Sinha, Samiran: And in co-op sampling, For some parameters, we will sample Prompt… Sinha, Samiran: A distribution which is marginalized over some components of the parameter. Sinha, Samiran: For instance, if you have two parameters, theta1 and theta2, we can sample Theta 1… from… Sinha, Samiran: This distribution, theta 1 given theta, And theta 2 from…

2:03 Sinha, Samiran: The conditional distribution, conditioning on theta 1 and theta. Sinha, Samiran: So, what was the advantage? Advantage is… is that… The sample values, theta1, theta2, Are no longer correlated. Sinha, Samiran: from t and t minus 1 at the iteration. Sinha, Samiran: If we do collapsing. So here we collapsed. Sinha, Samiran: Theta 2 when we sample theta 1. Sinha, Samiran: Now, this concept can be generalized from two components to multiple components of a parameter. So, suppose we have three components, theta 1, theta2, theta 3.

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, Samiran Sinha.

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.