Non-asymptotic mixing of the MALA algorithm

Details Non-asymptotic mixing of the MALA algorithm Non-asymptotic mixing of the MALA algorithm

2010-08-20

arxiv.org/abs/1008.3514v1

Mathematics

Probability

34 pages

Scientific paper

The Metropolis-Adjusted Langevin Algorithm (MALA), originally introduced to sample exactly the invariant measure of certain stochastic differential equations (SDE) on infinitely long time intervals, can also be used to approximate pathwise the solution of these SDEs on finite time intervals. However, when applied to an SDE with a nonglobally Lipschitz drift coefficient, the algorithm may not have a spectral gap even when the SDE does. This paper reconciles MALA's lack of a spectral gap with its ergodicity to the invariant measure of the SDE and finite time accuracy. In particular, the paper shows that its convergence to equilibrium happens at exponential rate up to terms exponentially small in time-stepsize. This quantification relies on MALA's ability to exactly preserve the SDE's invariant measure and accurately represent the SDE's transition probability on finite time intervals.

Affiliated with

Also associated with

No associations

Rating

Non-asymptotic mixing of the MALA algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-asymptotic mixing of the MALA algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-asymptotic mixing of the MALA algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81059