The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
Open accessAbstract
Summary: 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
Analysis and Geometry of Markov Diffusion Operators
Bakry, D., Gentil, I., & Ledoux, M. (2014) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-319-00227-9 · Cited by 1,005
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Roberts, G. O., & Tweedie, R. L. (1996) · Bernoulli · doi:10.2307/3318418 · Cited by 998
General state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
Bayesian auxiliary variable models for binary and multinomial regression
Held, L., & Holmes, C. C. (2006) · Bayesian Analysis · doi:10.1214/06-ba105 · Cited by 434
Langevin Diffusions and Metropolis-Hastings Algorithms
Roberts, G. O., & Stramer, O. (2002) · Methodology And Computing In Applied Probability · doi:10.1023/a:1023562417138 · Cited by 261
Geometric ergodicity of Metropolis algorithms
Jarner, S. F., & Hansen, E. (2000) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(99)00082-4 · Cited by 218
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Durmus, A., & Moulines, É. (2017) · The Annals of Applied Probability · doi:10.1214/16-aap1238 · Cited by 216
Proximal Markov chain Monte Carlo algorithms
Pereyra, M. (2015) · Statistics and Computing · doi:10.1007/s11222-015-9567-4 · Cited by 168
Quantitative bounds on convergence of time-inhomogeneous Markov chains
Douc, R., Moulines, É., & Rosenthal, J. S. (2004) · The Annals of Applied Probability · doi:10.1214/105051604000000620 · Cited by 116
Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
Pillai, N. S., Stuart, A. M., & Thiéry, A. H. (2012) · The Annals of Applied Probability · doi:10.1214/11-aap828 · Cited by 86
On the computational complexity of MCMC-based estimators in large samples
Belloni, A., & Chernozhukov, V. (2009) · The Annals of Statistics · doi:10.1214/08-aos634 · Cited by 82
Langevin-Type Models II: Self-Targeting Candidates for MCMC Algorithms*
Stramer, O., & Tweedie, R. L. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010090512027 · Cited by 73
Langevin-Type Models I: Diffusions with Given Stationary Distributions and their Discretizations*
Stramer, O., & Tweedie, R. L. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010086427957 · Cited by 68
Adaptive Markov chain Monte Carlo: theory and methods
Atchadé, Y. F., Fort, G., Moulines, É., & Priouret, P. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511984679.003 · Cited by 67
Recursive computation of the invariant distribution of a diffusion
Lamberton, D., & Pagès, G. (2002) · Bernoulli · Cited by 65
Informative g-Priors for Logistic Regression
Hanson, T., Branscum, A. J., & Johnson, W. O. (2014) · Bayesian Analysis · doi:10.1214/14-ba868 · Cited by 51
On the computational complexity of MCMC-based estimators in large samples
Belloni, A., & Chernozhukov, V. (2017) · doi:10.1920/wp.cem.2007.1207 · Cited by 47
A Shrinkage-Thresholding Metropolis Adjusted Langevin Algorithm for Bayesian Variable Selection
Schreck, A., Fort, G., Corff, S. L., et al. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2496546 · Cited by 34
MCMC convergence diagnosis via multivariate bounds on log-concave densities
Brooks, S. P. (1998) · The Annals of Statistics · doi:10.1214/aos/1030563991 · Cited by 28
Convergence rates for MCMC algorithms for a robust Bayesian binary regression model
Roy, V. (2012) · Electronic Journal of Statistics · doi:10.1214/12-ejs756 · Cited by 21
Metadata
- Authors
- Dalalyan, A. S.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2016-04-23
- Volume
- 79
- Issue
- 3
- Pages
- 651-676
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W2222154095
- Cited by
- 315
- References
- 24
- FWCI
- 24.02
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.