paper-with-me

홈 › Papers

Theoretical guarantees for approximate sampling from smooth and log-concave densities

2014-12-23 · Arnak S. Dalalyan

Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling from a given distribution is impossible or computationally expensive and, therefore, one needs to resort to approximate sampling strategies. However, there is no well-developed theory providing meaningful nonasymptotic guarantees for the approximate sampling procedures, especially in the high-dimensional problems. This paper makes some progress in this direction by considering the problem of sampling from a distribution having a smooth and log-concave density defined on \(\RR^p\), for some integer \(p>0\). We establish nonasymptotic bounds for the error of approximating the target distribution by the one obtained by the Langevin Monte Carlo method and its variants. We illustrate the effectiveness of the established guarantees with various experiments. Underlying our analysis are insights from the theory of continuous-time diffusion processes, which may be of interest beyond the framework of log-concave densities considered in the present work.

📄 PDF Abstract BibTeX arXiv:1412.7392

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Complexity of Non-Log-Concave Sampling in Fisher Information

2026-05-15 · Sinho Chewi, Andre Wibisono arxiv

We study the query complexity of obtaining a relative Fisher information guarantee for sampling from a log-smooth non-log-concave distribution; this is a sampling analog of finding an approximate stationary point in opti…

Double-Loop Unadjusted Langevin Algorithm

2020-01-01 · ICML 2020 1 · Paul Rolland, Armin Eftekhari, Ali Kavis, Volkan Cevher

A well-known first-order method for sampling from log-concave probability distributions is the Unadjusted Langevin Algorithm (ULA). This work proposes a new annealing step-size schedule for ULA, which allows to prove n…

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel

2024-06-03 · Shivam Gupta, Linda Cai, Sitan Chen

Sampling algorithms play an important role in controlling the quality and runtime of diffusion model inference. In recent years, a number of works~\cite{chen2023sampling,chen2023ode,benton2023error,lee2022convergence} ha…

The query complexity of sampling from strongly log-concave distributions in one dimension

2021-05-29 · Sinho Chewi, Patrik Gerber, Chen Lu, Thibaut Le Gouic 외

We establish the first tight lower bound of $\Omega(\log\log\kappa)$ on the query complexity of sampling from the class of strongly log-concave and log-smooth distributions with condition number $\kappa$ in one dimension…

Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms

2023-05-25 · Tim Tsz-Kit Lau, Han Liu, Thomas Pock

We study the problem of approximate sampling from non-log-concave distributions, e.g., Gaussian mixtures, which is often challenging even in low dimensions due to their multimodality. We focus on performing this task via…

Bayesian InferenceImage Deconvolution