Sampling, Diffusions, and Stochastic Localization

Abstract

Diffusions are a successful technique to sample from high-dimensional distributions. The target distribution can be either explicitly given or learnt from a collection of samples. They implement a diffusion process whose endpoint is a sample from the target distribution. The drift of the diffusion process is typically represented as a neural network. Stochastic localization is a successful technique to prove mixing of Markov Chains and other functional inequalities in high dimension. An algorithmic version of stochastic localization was recently proposed in order to sample from certain statistical mechanics models. This expository article has three objectives: (i)~Generalize the algorithmic construction to other stochastic localization processes. This construction is both simple and broadly applicable; (ii)~Clarify the connection between diffusions and stochastic localization. This allows to derive several known sampling schemes in a unified fashion; (iii)~Describe the insights that follow from this unified viewpoint.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…