Scientific article
Open access

Fast Langevin based algorithm for MCMC in high dimensions

Published inAnnals of Applied Probability, vol. 27, no. 4, p. 2195-2237
Publication date2017

We introduce new Gaussian proposals to improve the efficiency of the standard Hastings-Metropolis algorithm in Markov chain Monte Carlo (MCMC) methods, used for the sampling from a target distribution in large dimension $d$. The improved complexity is $mathcal{O}(d^{1/5})$ compared to the complexity $mathcal{O}(d^{1/3})$ of the standard approach. We prove an asymptotic diffusion limit theorem and show that the relative efficiency of the algorithm can be characterised by its overall acceptance rate (with asymptotical value 0.704), independently of the target distribution. Numerical experiments confirm our theoretical findings.

  • arxiv : math.NA
Research group
Citation (ISO format)
DURMUS, Alain et al. Fast Langevin based algorithm for MCMC in high dimensions. In: Annals of Applied Probability, 2017, vol. 27, n° 4, p. 2195–2237. doi: 10.1214/16-AAP1257
Main files (1)
Article (Accepted version)
ISSN of the journal1050-5164

Technical informations

Creation09/20/2017 9:06:00 AM
First validation09/20/2017 9:06:00 AM
Update time03/15/2023 2:02:50 AM
Status update03/15/2023 2:02:50 AM
Last indexation05/02/2024 7:30:50 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack