Estimating Normalizing Constants for Log-Concave Distributions - Algorithms and Lower Bounds

Estimating Normalizing Constants for Log-Concave Distributions - Algorithms and Lower Bounds

Association for Computing Machinery (ACM) via YouTube Direct link

Intro

1 of 13

1 of 13

Intro

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. 1 Intro
  2. 2 Problem statement
  3. 3 Upper bound: Annealing
  4. 4 Upper bound: Multilevel Monte Carlo
  5. 5 Regular Monte Carlo
  6. 6 Sampling algorithm: Langevin dynamics
  7. 7 Discretizing Langevin dynamics
  8. 8 Coupling Langevin dynamics (Overdamped)
  9. 9 Lower bound for low dimensions
  10. 10 Proof idea
  11. 11 Distinguishing biased coins
  12. 12 Lower bound for high dimensions Take product distribution Partition de dimensions into
  13. 13 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.