CSE 599 Counting and Sampling
In this course we will study several techniques developed in the last 30 years to sample from sophisticated probability distributions of exponential size. Approximately half of the course will focus on techniques based on Markov Chain Monte Carlo techniques. In the rest of the course we will see more modern results based on Correlation decay and geometry of Polynomials. Several of the notes on analysis of Markov chains are heavily borrowed from Sinclair's Courese Notes.
In this course we will study several techniques developed in the last 30 years to sample from sophisticated probability distributions of exponential size. Approximately half of the course will focus on techniques based on Markov Chain Monte Carlo techniques. In the rest of the course we will see more modern results based on Correlation decay and geometry of Polynomials. Administrative Information Instructor: Shayan Oveis Gharan Office Hours: By appointment, email me at shayan at cs dot washington dot edu. Lectures: Wednesday - Friday 3:00 - 4:20 at Low 116 Assignments Problem Set 1,…
saved by
related reading
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- survey.dvimath.uchicago.edu
- CSE 599 Recent Developments in Approximation Algorithmshomes.cs.washington.edu
- Frederic Koehlerfrkoehle.github.io
- practicalqmc.pdfartowen.su.domains
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
- Statistics 386 Winter 2013galton.uchicago.edu
- Nicholas Cook - Duke Mathsites.math.duke.edu
- Writing - betanalpha.github.iobetanalpha.github.io
- Research • Leonid Petrov. Integrable Probabilitylpetrov.cc
- Sampling: Two Basic Algorithmsgregorygundersen.com
- Competing with sampling — Alignment Research Centeralignment.org