DeepAI AI Chat
Log In Sign Up

Unajusted Langevin algorithm with multiplicative noise: Total variation and Wasserstein bounds

by   Gilles Pagès, et al.

In this paper, we focus on non-asymptotic bounds related to the Euler scheme of an ergodic diffusion with a possibly multiplicative diffusion term (non-constant diffusion coefficient). More precisely, the objective of this paper is to control the distance of the standard Euler scheme with decreasing step (usually called Unajusted Langevin Algorithm in the Monte-Carlo literature) to the invariant distribution of such an ergodic diffusion. In an appropriate Lyapunov setting and under uniform ellipticity assumptions on the diffusion coefficient, we establish (or improve) such bounds for Total Variation and L 1-Wasserstein distances in both multiplicative and additive and frameworks. These bounds rely on weak error expansions using Stochastic Analysis adapted to decreasing step setting.


page 1

page 2

page 3

page 4


Higher Order Langevin Monte Carlo Algorithm

A new (unadjusted) Langevin Monte Carlo (LMC) algorithm with improved ra...

A sharp uniform-in-time error estimate for Stochastic Gradient Langevin Dynamics

We establish a sharp uniform-in-time error estimate for the Stochastic G...

Analysis of a modified Euler scheme for parabolic semilinear stochastic PDEs

We propose a modification of the standard linear implicit Euler integrat...

Convergence of diffusions and their discretizations: from continuous to discrete processes and back

In this paper, we establish new quantitative convergence bounds for a cl...

Discrete sticky couplings of functional autoregressive processes

In this paper, we provide bounds in Wasserstein and total variation dist...

High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion

The efficiency of a markov sampler based on the underdamped Langevin dif...