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

被引:246
作者
Dalalyan, Arnak S. [1 ]
机构
[1] ParisTech, Paris, France
关键词
Approximate sampling; Langevin algorithm; Markov chain Monte Carlo methods; Rates of convergence; CONVERGENCE-RATES; LANGEVIN; BOUNDS; ALGORITHMS; BINARY; MODELS;
D O I
10.1111/rssb.12183
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Sampling from various kinds of distribution 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, 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 non-asymptotic guarantees for the approximate sampling procedures, especially in high dimensional problems. The 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 Rp, for some integer p>0. We establish non-asymptotic bounds for the error of approximating the target distribution by the distribution 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 that are considered in the present work.
引用
收藏
页码:651 / 676
页数:26
相关论文
共 37 条
[1]  
[Anonymous], 2002, Methodology and Computing in Applied Probability, DOI [10.1023/A:1023562417138, DOI 10.1023/A:1023562417138]
[2]  
[Anonymous], 2014, Introductory Lectures on Convex Optimization: A Basic Course
[3]  
[Anonymous], THESIS
[4]  
Atchade Y., 2011, Bayesian Time Series Models, P32, DOI DOI 10.1017/CBO9780511984679.003
[5]  
Bakry D., 2014, Analysis and geometry of Markov diffusion operators
[6]   ON THE COMPUTATIONAL COMPLEXITY OF MCMC-BASED ESTIMATORS IN LARGE SAMPLES [J].
Belloni, Alexandre ;
Chernozhukov, Victor .
ANNALS OF STATISTICS, 2009, 37 (04) :2011-2055
[7]   Nonasymptotic mixing of the MALA algorithm [J].
Bou-Rabee, N. ;
Hairer, M. .
IMA JOURNAL OF NUMERICAL ANALYSIS, 2013, 33 (01) :80-110
[8]  
Boyd S., 2004, Convex optimization, DOI [10.1017/cbo97805118044 41, 10.1017/CBO9780511804441]
[9]  
Brooks SP, 1998, ANN STAT, V26, P398
[10]   Estimation of spectral gap for elliptic operators [J].
Chen, MF ;
Wang, FY .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1997, 349 (03) :1239-1267