Related papers: Convergence of Reflected Langevin Diffusion for Co…
In this work we develop an effective Monte Carlo method for estimating sensitivities, or gradients of expectations of sufficiently smooth functionals, of a reflected diffusion in a convex polyhedral domain with respect to its defining…
This paper focuses on studying the convergence rate of the density function of the Euler--Maruyama (EM) method, when applied to the overdamped generalized Langevin equation with fractional noise which serves as an important model in many…
Motivated by the task of computing normalizing constants and importance sampling in high dimensions, we study the dimension dependence of fluctuations for additive functionals of time-inhomogeneous Langevin-type diffusions on…
The exponential contraction in $L^1$-Wasserstein distance and exponential convergence in $L^q$-Wasserstein distance ($q\geq 1$) are considered for stochastic differential equations with irregular drift. When the irregular drift drift is…
Standard first-order Langevin algorithms such as the unadjusted Langevin algorithm (ULA) are obtained by discretizing the Langevin diffusion and are widely used for sampling in machine learning because they scale to high dimensions and…
The asymptotic behaviour of empirical measures has plenty of studies. However, the research on conditional empirical measures is limited. Being the development of Wang \cite{eW1}, under the quadratic Wasserstein distance, we investigate the…
Diffusion in nonhomogeneous media is described by a dynamical process driven by a general Levy noise and subordinated to a random time; the subordinator depends on the position. This problem is approximated by a multiplicative process…
We introduce a Langevin equation characterized by a time dependent drift. By assuming a temporal power-law dependence of the drift we show that a great variety of behavior is observed in the dynamics of the variance of the process. In…
Many methods that build powerful variational distributions based on unadjusted Langevin transitions exist. Most of these were developed using a wide range of different approaches and techniques. Unfortunately, the lack of a unified analysis…
Constrained diffusions in convex polyhedral domains with a general oblique reflection field, and with a diffusion coefficient scaled by a small parameter, are considered. Using an interior Dirichlet heat kernel lower bound estimate for…
Sampling from discrete distributions is a ubiquitous task in machine learning, recently revisited by the emergence of discrete diffusion models. While Langevin algorithms constitute the state of the art for continuous spaces, discrete…
In this paper, we establish new quantitative convergence bounds for a class of functional autoregressive models in weighted total variation metrics. To derive our results, we show that under mild assumptions, explicit minorization and…
Sampling from score-based diffusion models incurs bias due to both time discretisation and the approximation of the score function. A common strategy for reducing this bias is to apply corrector steps based on the unadjusted Langevin…
We prove existence and uniqueness for semimartingale reflecting diffusions in 2-dimensional piecewise smooth domains with varying, oblique directions of reflection on each "side", under geometric, easily verifiable conditions. Our…
We study Langevin dynamics with stochastic diffusivity arising from fluctuations of the surrounding medium. The diffusivity is modeled as Ornstein-Uhlenbeck process driven by symmetric dichotomous noise, which confines it to a finite…
Langevin algorithms are gradient descent methods with additive noise. They have been used for decades in Markov chain Monte Carlo (MCMC) sampling, optimization, and learning. Their convergence properties for unconstrained non-convex…
We study the quantitative convergence of drift-diffusion PDEs that arise as Wasserstein gradient flows of linearly convex functions over the space of probability measures on ${\mathbb R}^d$. In this setting, the objective is in general not…
We present several approaches for deriving the coarse-grained continuous Langevin equation (or Edwards-Wilkinson equation) from a random deposition with surface relaxation (RDSR) model. First we introduce a novel procedure to divide the…
In this paper we consider the Stratonovich reflected stochastic differential equation $dX_t=\sigma(X_t)\circ dW_t+b(X_t)dt+dL_t$ in a bounded domain $\O$ which satisfies conditions, introduced by Lions and Sznitman, which are specified…
We derive and analyze numerical methods for underdamped (kinetic) Langevin dynamics in a domain with elastic reflection at the boundary. First-order approximations are based on an Euler-type scheme incorporating collision-handling at the…