Approximation of heavy-tailed distributions via stable-driven SDEs

From MaRDI portal
Publication:2040106



Abstract: Constructions of numerous approximate sampling algorithms are based on the well-known fact that certain Gibbs measures are stationary distributions of ergodic stochastic differential equations (SDEs) driven by the Brownian motion. However, for some heavy-tailed distributions it can be shown that the associated SDE is not exponentially ergodic and that related sampling algorithms may perform poorly. A natural idea that has recently been explored in the machine learning literature in this context is to make use of stochastic processes with heavy tails instead of the Brownian motion. In this paper we provide a rigorous theoretical framework for studying the problem of approximating heavy-tailed distributions via ergodic SDEs driven by symmetric (rotationally invariant) alpha-stable processes.


Heavy-tailed distributions have been found to be very useful in many applications. Yet related sampling algorithms may perform poorly. In this paper, the authors provide a rigorous theoretical framework for studying the problem of approximating heavy-tailed distributions via ergodic SDEs driven by rotationally invariant \(\alpha\)-stable processes.



Cites work









This page was built for publication: Approximation of heavy-tailed distributions via stable-driven SDEs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040106)