Related papers: Sharp hypocoercive convergence estimates for under…
Sampling from a target distribution is a fundamental problem. Traditional Markov chain Monte Carlo (MCMC) algorithms, such as the unadjusted Langevin algorithm (ULA), derived from the overdamped Langevin dynamics, have been extensively…
We provide a complete elaboration of the $L^2$-Hilbert space hypocoercivity theorem for the degenerate Langevin dynamics with multiplicative noise, studying the longtime behaviour of the strongly continuous contraction semigroup solving the…
We study the problem of sampling from a probability distribution $\pi$ on $\rset^d$ which has a density \wrt\ the Lebesgue measure known up to a normalization factor $x \mapsto \rme^{-U(x)} / \int_{\rset^d} \rme^{-U(y)} \rmd y$. We analyze…
We establish that, for a Markov semi-group, $L^2$ hypocoercivity, i.e. contractivity for a modified $L^2$ norm, implies quantitative deviation bounds for additive functionals of the associated Markov process and exponential integrability of…
Overdamped Langevin dynamics are reversible stochastic differential equations which are commonly used to sample probability measures in high-dimensional spaces, such as the ones appearing in computational statistical physics and Bayesian…
We provide a complete elaboration of the $L^2$-Hilbert space hypocoercivity theorem for the degenerate Langevin dynamics via studying the longtime behavior of the strongly continuous contraction semigroup solving the associated Kolmogorov…
We propose a novel kinetic Langevin sampler based on a specific splitting scheme using the exact harmonic Langevin integrator. For strongly log-concave target measures, the sampler exploits a decomposition of the strongly convex potential…
In this work we consider the unbiased estimation of expectations w.r.t.~probability measures that have non-negative Lebesgue density, and which are known point-wise up-to a normalizing constant. We focus upon developing an unbiased method…
We study and develop multilevel methods for the numerical approximation of a log-concave probability $\pi$ on $\mathbb{R}^d$, based on (over-damped) Langevin diffusion. In the continuity of \cite{art:egeapanloup2021multilevel} concentrated…
We present a novel method for drawing samples from Gibbs distributions with densities of the form $\pi(x) \propto \exp(-U(x))$. The method accelerates the unadjusted Langevin algorithm by introducing an inertia term similar to Polyak's…
In non-equilibrium statistical physics models, the invariant measure $\mu$ of the process does not have an explicit density. In particular the adjoint $L^*$ in $L^2(\mu)$ of the generator $L$ is unknown and many classical techniques fail in…
In this article we develop a new abstract strategy for proving ergodicity with explicit computable rate of convergence for diffusions associated with a degenerate Kolmogorov operator L. A crucial point is that the evolution operator L may…
We study the long-time behavior of the underdamped Langevin dynamics, in the case of so-called \emph{weak confinement}. Indeed, any $\mathrm{L}^\infty$ distribution (in position and velocity) relaxes to equilibrium over time, and we…
We consider numerical approximations of overdamped Langevin stochastic differential equations by implicit methods. We show a weak backward error analysis result in the sense that the generator associated with the numerical solution…
The classical (overdamped) Langevin dynamics provide a natural algorithm for sampling from its invariant measure, which uniquely minimizes an energy functional over the space of probability measures, and which concentrates around the…
In this paper, we apply discontinuous finite element Galerkin method to the time-dependent $2D$ incompressible Navier-Stokes model. We derive optimal error estimates in $L^\infty(\textbf{L}^2)$-norm for the velocity and in…
Discretization of continuous-time diffusion processes is a widely recognized method for sampling. However, the canonical Euler Maruyama discretization of the Langevin diffusion process, referred as Unadjusted Langevin Algorithm (ULA),…
Discretization of continuous-time diffusion processes is a widely recognized method for sampling. However, it seems to be a considerable restriction when the potentials are often required to be smooth (gradient Lipschitz). This paper…
We study the problem of sampling from a target distribution $\pi(q)\propto e^{-U(q)}$ on $\mathbb{R}^d$, where $U$ can be non-convex, via the Hessian-free high-resolution (HFHR) dynamics, which is a second-order Langevin-type process that…
The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve sampling problems and non-convex optimization appearing in several machine learning applications. Especially, its variance reduced versions have…