Completed
Sampling algorithm: Langevin dynamics
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Estimating Normalizing Constants for Log-Concave Distributions - Algorithms and Lower Bounds
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Problem statement
- 3 Upper bound: Annealing
- 4 Upper bound: Multilevel Monte Carlo
- 5 Regular Monte Carlo
- 6 Sampling algorithm: Langevin dynamics
- 7 Discretizing Langevin dynamics
- 8 Coupling Langevin dynamics (Overdamped)
- 9 Lower bound for low dimensions
- 10 Proof idea
- 11 Distinguishing biased coins
- 12 Lower bound for high dimensions Take product distribution Partition de dimensions into
- 13 Conclusion