The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Abstract
In this paper we consider a continuous-time method of approximating a given distribution [math] using the Langevin diffusion [math] . We find conditions under which this diffusion converges exponentially quickly to [math] or does not: in one dimension, these are essentially that for distributions with exponential tails of the form [math] , [math] , exponential convergence occurs if and only if [math] . We then consider conditions under which the discrete approximations to the diffusion converge. We first show that even when the diffusion itself converges, naive discretizations need not do so. We then consider a 'Metropolis-adjusted' version of the algorithm, and find conditions under which this also converges at an exponential rate: perhaps surprisingly, even the Metropolized version need not converge exponentially fast even if the diffusion does. We briefly discuss a truncated form of the algorithm which, in practice, should avoid the difficulties of the other forms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“In order to describe the approach, it is useful to outline the standard construction of the Hastings and Metropolis algorithms (see Metropolis et al. 1953; Hastings 1970).”
MethodDoob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Self-citationStochastic Differential Equations and Diffusion Processes
Kallianpur, G. B. (1983) · Technometrics · doi:10.1080/00401706.1983.10487861 · Cited by 3,836
Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods
Smith, A. F. M., & Roberts, G. O. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01466.x · Cited by 1,713 · cited 1×
“…distribution in a Bayesian context: see Besag and Green (1993), Besag et al. (1995), Mengersen and Tweedie (1996), Roberts and Tweedie (1996), Smith and Roberts (1993) and Tierney (1994) for a variety of approaches and properties of such methods, and their applications in statistical…”
BackgroundSelf-citationMonte Carlo Sampling Methods Using Markov Chains and Their Applications
Hastings, W. K. (1970) · Biometrika · doi:10.2307/2334940 · Cited by 1,443
Davis, M. H. (1993) · Medical Entomology and Zoology · Cited by 887
Representations of Knowledge in Complex Systems
Grenander, U., & Miller, M. I. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb02000.x · Cited by 603
Rates of convergence of the Hastings and Metropolis algorithms
Mengersen, K. L., & Tweedie, R. L. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066201 · Cited by 553
Self-citation
Cited by
Rue, H., Martino, S., & Chopin, N. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00700.x · Cited by 5,279
Handbook of Markov Chain Monte Carlo
Brooks, S., Gelman, A., Jones, G., & Meng, X.-L. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b10905 · Cited by 2,993
Lindgren, F., Rue, H., & Lindström, J. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00777.x · Cited by 2,708
MCMC Using Hamiltonian Dynamics
Neal, R. M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-6 · Cited by 2,574
Inverse problems: A Bayesian perspective
Stuart, A. M. (2010) · Acta Numerica · doi:10.1017/s0962492910000061 · Cited by 1,791
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
Huber, M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-10 · Cited by 1,176
Optimal scaling for various Metropolis-Hastings algorithms
Roberts, G. O., & Rosenthal, J. S. (2001) · Statistical Science · doi:10.1214/ss/1015346320 · Cited by 1,103
Self-citationBond-Taylor, S., Leach, A., Long, Y., & Willcocks, C. G. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3116668 · Cited by 703
Computational and Inferential Difficulties with Mixture Posterior Distributions
Celeux, G., Hurn, M., & Robert, C. P. (2000) · Journal of the American Statistical Association · doi:10.1080/01621459.2000.10474285 · Cited by 604
Plug & Play Generative Networks: Conditional Iterative Generation of Images in Latent Space
Nguyen, A., Clune, J., Bengio, Y., Dosovitskiy, A., & Yosinski, J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.374 · Cited by 578
Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise
Mattingly, J. C., Stuart, A. M., & Higham, D. J. (2002) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(02)00150-3 · Cited by 550
Plug and Play Language Models: A Simple Approach to Controlled Text Generation
Dathathri, S., Madotto, A., Lan, J., Hung, J., Frank, E., Molino, P., Yosinski, J., & Liu, R. (2019) · arXiv · doi:10.48550/arxiv.1912.02164 · Cited by 508
Improved Techniques for Training Score-Based Generative Models
Song, Y., & Ermon, S. (2020) · arXiv · doi:10.48550/arxiv.2006.09011 · Cited by 482
Convergence assessment techniques for Markov chain Monte Carlo
BROOKS, S. P., & ROBERTS, G. O. (1998) · Statistics and Computing · doi:10.1023/a:1008820505350 · Cited by 463
Self-citationMartin, J., Wilcox, L. C., Burstedde, C., & Ghattas, O. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/110845598 · Cited by 424
A Tutorial on Thompson Sampling
Russo, D. J., Van Roy, B., Kazerouni, A., Osband, I., & Wen, Z. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834710 · Cited by 380
Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
Dalalyan, A. S. (2017) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12183 · Cited by 315
Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions
Brooks, S. P., Giudici, P., & Roberts, G. O. (2003) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.03711 · Cited by 310
Self-citationStochastic Seismic Waveform Inversion Using Generative Adversarial Networks as a Geological Prior
Mosser, L., Dubrule, O., & Blunt, M. J. (2020) · Mathematical Geosciences · doi:10.1007/s11004-019-09832-6 · Cited by 275
Chain Graph Models and their Causal Interpretations
Lauritzen, S. L., & Richardson, T. S. (2002) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00340 · Cited by 265
Spatial and Spatio-Temporal Log-Gaussian Cox Processes: Extending the Geostatistical Paradigm
Diggle, P. J., Moraga, P., Rowlingson, B., & Taylor, B. M. (2013) · Statistical Science · doi:10.1214/13-sts441 · Cited by 262
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
Self-citationOptimal tuning of the hybrid Monte Carlo algorithm
Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M., & Stuart, A. (2013) · Bernoulli · doi:10.3150/12-bej414 · Cited by 261
Self-citationStochastic Processes and Applications: Diffusion Processes, the Fokker-Planck and Langevin Equations
Pavliotis, G. A. (2014) · Texts in Applied Mathematics · doi:10.1007/978-1-4939-1323-7 · Cited by 256
Zero-inflated models with application to spatial count data
Agarwal, D. K., Gelfand, A. E., & Citron-Pousty, S. (2002) · Environmental and Ecological Statistics · doi:10.1023/a:1020910605990 · Cited by 252
Petra, N., Martin, J., Stadler, G., & Ghattas, O. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/130934805 · Cited by 252
Bayesian Analysis of Agricultural Field Experiments
Besag, J., & Higdon, D. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00201 · Cited by 183
Sampling methods for solving Bayesian model updating problems: A tutorial
Lye, A., Cicirello, A., & Patelli, E. (2021) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2021.107760 · Cited by 169
Consistency and fluctuations for stochastic gradient Langevin dynamics
(2016) · Warwick Research Archive Portal (University of Warwick) · doi:10.5555/2946645.2946652 · Cited by 104
Adversarial score matching and improved sampling for image generation
Jolicoeur-Martineau, A., Piché-Taillefer, R., Combes, R. T. D., & Mitliagkas, I. (2020) · arXiv · doi:10.48550/arxiv.2009.05475 · Cited by 88
Aitchison, L., & Lengyel, M. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005186 · Cited by 67
Stochastic Image Denoising by Sampling from the Posterior Distribution
Kawar, B., Vaksman, G., & Elad, M. (2021) · 2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW) · doi:10.1109/iccvw54120.2021.00213 · Cited by 42
An efficient Bayesian inference framework for coalescent-based nonparametric phylodynamics
Lan, S., Palacios, J. A., Karcher, M., Minin, V. N., & Shahbaba, B. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv378 · Cited by 38
Inferring kinetic parameters of oscillatory gene regulation from single cell time-series data
Burton, J., Manning, C. S., Rattray, M., Papalopulu, N., & Kursawe, J. (2021) · Journal of The Royal Society Interface · doi:10.1098/rsif.2021.0393 · Cited by 9
Metadata
- Authors
- Roberts, G. O., & Tweedie, R. L.
- Venue
- Bernoulli
- Publisher
- JSTOR
- Published
- 1996-12
- Volume
- 2
- Issue
- 4
- Pages
- 341
- ISSN
- 1350-7265 (ISSN-L)
- OpenAlex
- W1983452151
- Cited by
- 998
- References
- 16
- FWCI
- 2.77
- Type
- journal article
- Language
- en
- Open access
- closed
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.