Parallel Discrete Sampling via Continuous Walks
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a groundbreaking framework for sampling from discrete distributions on the hypercube through continuous distributions in this 57-minute lecture by Nima Anari from Stanford University. Delve into the process of convolving discrete distributions with spherical Gaussians to yield well-conditioned log-concave distributions. Learn about the novel discretization of the stochastic localization process, enabling high accuracy and parallelism in sampling. Discover how this approach resolves open questions on parallel sampling of distributions that allow parallel counting, leading to the first polylogarithmic-time sampling algorithms for determinantal point processes, directed Eulerian tours, and more.
Syllabus
Parallel Discrete Sampling via Continuous Walks
Taught by
Simons Institute
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera