This course develops computational methods for statistical estimation and inference: random-variable generation, Monte Carlo integration, importance sampling, likelihood optimization, EM, data augmentation, MCMC, Kalman and particle filtering, resampling, robust statistics and regression, causal graphical algorithms, and causal effect estimation.
Students will learn to derive and implement representative algorithms, state their assumptions, diagnose inappropriate applications, and interpret results. Causal computation covers both algorithms for a given DAG and the limitations of learning a graph from data.
Problem Set 1. Due on Oct. 12
Suggested team size: 1–4 students.
Proposal: one page stating the problem, methods and example; due November 16.
Presentations: December 21 and 23. Proposed format: 15 minutes plus 5 minutes of questions, for up to eight teams; adjusted if enrollment requires it.
Report: 6–8 pages of main text, with code and a contribution statement; final deadline TBD.
| Class | Week | Date | Topic | Milestone |
|---|---|---|---|---|
| 1 | 1 | Mon 09/07 | Random-variable generation I | |
| 2 | 2 | Mon 09/14 | Random-variable generation II | |
| 3 | 2 | Wed 09/16 | Monte Carlo integration and methods | |
| 4 | 3 | Mon 09/21 | Importance sampling | PS1 out |
| 5 | 4 | Mon 09/28 | Varaince reduction | |
| 6 | 4 | Wed 09/30 | No class | |
| – | 5 | Mon 10/05 | No class: National Day holiday | |
| 7 | 6 | Mon 10/12 | Bootstrap | PS1 due |
October 5 is a holiday.
Chapter and page references below use these editions. Kalman filtering and causal methods use the supplementary readings listed at the end. Readings are alternatives and selected passages, not a requirement to read all five books for each class.