Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Unadjusted Langevin algorithm with multiplicative noise: Total variation and Wasserstein bounds (2012.14310v2)

Published 28 Dec 2020 in math.PR, math.ST, and stat.TH

Abstract: 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 Unadjusted 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 $L1$-Wasserstein distances in both multiplicative and additive and frameworks. These bounds rely on weak error expansions using {Stochastic Analysis} adapted to decreasing step setting.

Summary

We haven't generated a summary for this paper yet.