
Lecture slides
Review lecture
Generating Uniform Random Samples
Binomial Example
Inverse Transform Method
Accept Reject Algorithm
Compute tail probabilities for the standard normal with Monte Carlo by exploiting symmetry and splitting the unbounded region into negative and positive parts, estimating p-values from sample fractions above thresholds.
Explore importance sampling to improve tail probability estimates by weighting samples from a chosen proposal density g, such as a truncated exponential, to better estimate P(X>4) for a normal distribution.
Apply paired bootstrap to a linear regression of mpg on weight and am, resampling both dependent and independent variables to generate coefficient distributions and bias-corrected estimates.
Learn how to monitor convergence in Monte Carlo experiments by running many parallel trials, compare 95% confidence intervals, and use bootstrapping as a cheaper alternative.
Use antithetic variables to reduce variance in Monte Carlo estimates by pairing negatively correlated samples. This approach can outperform independent samples and save computational resources when experiments are costly.
Estimate E[H(x)] for x normal using simple Monte Carlo, compare with aesthetic variable estimation using half as many samples, and verify negative correlations.
Explore how simulated annealing escapes local maxima to find a global maximum by balancing exploration through temperature and probabilistic moves.
Explore the monte carlo em algorithm for missing data, iterating the expected complete data log-likelihood and its maximization using observed data to estimate theta.
Learn how the Metropolis-Hastings algorithm samples from a target density using a proposal distribution with an acceptance probability, illustrating independent Metropolis-Hastings through gamma and beta examples.
Apply Bayesian logistic regression to the o-ring dataset using a non-informative prior and a metropolis-hastings posterior, yielding 95 percent credible intervals for alpha and beta.
Explore Bayesian change point analysis on a time series of coal mine disasters (1851–1962) using a Gibbs sampler to infer a two-rate Poisson model and the change point.
Hi all,
As of June, 2022, I have to let you know that this course is out of date. I am busy with life and will not be able to respond to any messages or questions. The content was written when I was applying to grad schools in 2018 so it's a little rough, but the material will help anyone in their MS statistics/cs/economics programs. I unfortunately cannot change the pricing to free due to Udemy's policies, but I hope this provides people with some basic understanding of Monte Carlo methods and statistical computing.
Best wishes,
Jonathan
-------------------
This is a fully developed graduate-level course on Monte Carlo methods open to the public. I simplify much of the work created leaders in the field like Christian Robert and George Casella into easy to digest lectures with examples.
The target audience is anyone with a background in programming and statistics with a specific interest in Bayesian computation.
In this course, students tackle problems of generating random samples from target distributions through transformation methods and Markov Chains, optimizing numerical and combinatorial problems (i.e. Traveling Salesman Problem) and Bayesian computation for data analysis.
In this course, students have the opportunity to develop Monte Carlo algorithms into code "by hand" without needing to use "black-box" 3rd party packages.