paper-with-me

Papers

Contractive kinetic Langevin samplers beyond global Lipschitz continuity

2025-09-15 · Iosif Lytras, Panayotis Mertikopoulos arxiv

In this paper, we examine the problem of sampling from log-concave distributions with (possibly) superlinear gradient growth under kinetic (underdamped) Langevin algorithms. Using a carefully tailored taming scheme, we propose two novel discretizations of the kinetic Langevin SDE, and we show that they are both contractive and satisfy a log-Sobolev inequality. Building on this, we establish a series of non-asymptotic bounds in $2$-Wasserstein distance between the law reached by each algorithm and the underlying target measure.

📄 PDF Abstract BibTeX arXiv:2509.12031

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Randomized Runge-Kutta-Nyström Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlo

2023-10-11 · Nawaf Bou-Rabee, Tore Selland Kleppe

We introduce $5/2$- and $7/2$-order $L^2$-accurate randomized Runge-Kutta-Nystr\"{o}m methods, tailored for approximating Hamiltonian flows within non-reversible Markov chain Monte Carlo samplers, such as unadjusted Hami…

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…

Tuning Sequential Monte Carlo Samplers via Greedy Incremental Divergence Minimization

2025-03-19 · Kyurae Kim, Zuheng Xu, Jacob R. Gardner, Trevor Campbell

The performance of sequential Monte Carlo (SMC) samplers heavily depends on the tuning of the Markov kernels used in the path proposal. For SMC samplers with unadjusted Markov kernels, standard tuning objectives, such as…

Kinetic Interacting Particle Langevin Monte Carlo

2024-07-08 · Paul Felix Valsecchi Oliva, O. Deniz Akyildiz

This paper introduces and analyses interacting underdamped Langevin algorithms, termed Kinetic Interacting Particle Langevin Monte Carlo (KIPLMC) methods, for statistical inference in latent variable models. We propose a…

Regime-Switching Langevin Monte Carlo Algorithms

2025-08-31 · Xiaoyu Wang, Yingli Wang, Lingjiong Zhu arxiv

Langevin Monte Carlo (LMC) algorithms are popular Markov Chain Monte Carlo (MCMC) methods to sample a target probability distribution, which arises in many applications in machine learning. Inspired by regime-switching s…