paper-with-me

Papers

On couplings for kinetic Langevin diffusions

2026-05-29 · Nawaf Bou-Rabee, Sonja Cox, Roy Schieven arxiv

For the kinetic Langevin diffusion and its splitting discretizations, the hypoelliptic noise structure makes the relationship between couplings and total variation (TV) bounds more subtle than in the elliptic case. We establish that, for the kinetic Langevin equation with quadratic potential, no Markovian coupling (continuous or discrete) captures the asymptotic decay rate of the TV distance between two solutions with different initial values; the canonical iterated one-shot (or sticky) coupling, for which we derive an exact contraction formula, saturates this lower bound. On the constructive side, we show that the recent sharp TV bounds obtained by Chak and Monmarché admit a natural interpretation through an explicit non-Markovian coupling, built from an optimal coalescence trajectory characterized by a classical minimum-energy control problem. For the OBABO splitting scheme, this approach additionally eliminates the Hessian-Lipschitz, step-size, and final-time assumptions in the work of Chak and Monmarché.

📄 PDF Abstract BibTeX arXiv:2605.31088

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On sampling from a log-concave density using kinetic Langevin diffusions

2018-07-24 · Arnak S. Dalalyan, Lionel Riou-Durand

Langevin diffusion processes and their discretizations are often used for sampling from a target density. The most convenient framework for assessing the quality of such a sampling scheme corresponds to smooth and strong…

Randomized Midpoint Method for Log-Concave Sampling under Constraints

2024-05-24 · Yifeng Yu, Lu Yu

In this paper, we study the problem of sampling from log-concave distributions supported on convex, compact sets, with a particular focus on the randomized midpoint discretization of both vanilla and kinetic Langevin dif…

Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets

2019-06-20 · Arnak S. Dalalyan, Avetik Karagulyan, Lionel Riou-Durand

In this paper, we provide non-asymptotic upper bounds on the error of sampling from a target density using three schemes of discretized Langevin diffusions. The first scheme is the Langevin Monte Carlo (LMC) algorithm, t…

Score-based constrained generative modeling via Langevin diffusions with boundary conditions

2025-10-28 · Adam Nordenhög, Akash Sharma arxiv

Score-based generative models based on stochastic differential equations (SDEs) achieve impressive performance in sampling from unknown distributions, but often fail to satisfy underlying constraints. We propose a constr…

Exponential ergodicity of mirror-Langevin diffusions

2020-05-19 · NeurIPS 2020 12 · Sinho Chewi, Thibaut Le Gouic, Chen Lu, Tyler Maunu 외

Motivated by the problem of sampling from ill-conditioned log-concave distributions, we give a clean non-asymptotic convergence analysis of mirror-Langevin diffusions as introduced in Zhang et al. (2020). As a special ca…