paper-with-me

홈 › Papers

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion

2024-11-20 · Yunbum Kook, Santosh S. Vempala

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.

📄 PDF Abstract BibTeX arXiv:2411.13462

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Algorithmic Theory of ODEs and Sampling from Well-conditioned Logconcave Densities

2018-12-15 · Yin Tat Lee, Zhao Song, Santosh S. Vempala

Sampling logconcave functions arising in statistics and machine learning has been a subject of intensive study. Recent developments include analyses for Langevin dynamics and Hamiltonian Monte Carlo (HMC). While both app…

Operator-Level Quantum Acceleration of Non-Logconcave Sampling

2025-05-08 · Jiaqi Leng, Zhiyan Ding, Zherui Chen, Lin Lin

Sampling from probability distributions of the form $\sigma \propto e^{-\beta V}$, where $V$ is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However,…

A unified complexity bound for logconcave sampling

2026-06-10 · Yunbum Kook, Santosh S. Vempala arxiv

We give a simple, unified, and nearly tight bound for sampling arbitrary logconcave distributions from a warm start using the In-and-Out algorithm along with exponential lifting. The main new ingredient in the analysis i…

Faster logconcave sampling from a cold start in high dimension

2025-05-03 · Yunbum Kook, Santosh S. Vempala

We present a faster algorithm to generate a warm start for sampling an arbitrary logconcave density specified by an evaluation oracle, leading to the first sub-cubic sampling algorithms for inputs in (near-)isotropic pos…

Structured Logconcave Sampling with a Restricted Gaussian Oracle

2020-10-07 · Yin Tat Lee, Ruoqi Shen, Kevin Tian

We give algorithms for sampling several structured logconcave families to high accuracy. We further develop a reduction framework, inspired by proximal point methods in convex optimization, which bootstraps samplers for …