Sampling and Integration of Logconcave Functions by Algorithmic Diffusion

Yunbum Kook, Santosh S. Vempala
11/20/2024
cs.DScs.LGmath.ST

No confident code implementation found for this paper.

Abstract

We study the complexity of sampling, rounding, and integrating arbitrary logconcave functions. Our new approach provides the first complexity improvements in nearly two decades for general logconcave functions for all three problems, and matches the best-known complexities for the special case of uniform distributions on convex bodies. For the sampling problem, our output guarantees are significantly stronger than previously known, and lead to a streamlined analysis of statistical estimation based on dependent random samples.

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. Any repos shown below are weak matches — 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{kook2024sampling,
  title  = {Sampling and Integration of Logconcave Functions by Algorithmic Diffusion},
  author = {Yunbum Kook and Santosh S. Vempala},
  year   = {2024},
  eprint = {2411.13462},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.13462v1}
}

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/2411.13462.svg)](https://codeofpaper.com/paper/2411.13462)

Discussion