Sampling from multi-modal distributions with polynomial query complexity in fixed dimension via reverse diffusion

Adrien Vacher, Omar Chehab, Anna Korba
12/31/2024
stat.COcs.LGmath.ST

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Even in low dimensions, sampling from multi-modal distributions is challenging. We provide the first sampling algorithm for a broad class of distributions -- including all Gaussian mixtures -- with a query complexity that is polynomial in the parameters governing multi-modality, assuming fixed dimension. Our sampling algorithm simulates a time-reversed diffusion process, using a self-normalized Monte Carlo estimator of the intermediate score functions. Unlike previous works, it avoids metastability, requires no prior knowledge of the mode locations, and relaxes the well-known log-smoothness assumption which excluded general Gaussian mixtures so far.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{vacher2024sampling,
  title  = {Sampling from multi-modal distributions with polynomial query complexity in fixed dimension via reverse diffusion},
  author = {Adrien Vacher and Omar Chehab and Anna Korba},
  year   = {2024},
  eprint = {2501.00565},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.00565v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.00565.svg)](https://codeofpaper.com/paper/2501.00565)

Discussion