arXiv:2608. 06283v1 Announce Type: new Abstract: We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex.
By Iosif Lytras, Nikolaos Makras, Sotirios Sabanis
We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.
arXiv:2610.02158v1 Announce Type: cross
Abstract: We consider the problem of sampling from Gibbs distributions on matrix spaces whose potential energies are neither convex nor globally gradient-Lipsc...
By Nikolaos Makras, Sotirios Sabanis
The paper introduces penalized nonreversible Langevin algorithms for sampling from a target distribution constrained to a compact convex set. It combines a squared distance penalty with skew-symmetric perturbations that preserve the penalized Gibbs distribution, and provides nonasymptotic total variation and Wasserstein bounds under various smoothness and contraction assumptions. Numerical experiments demonstrate the methods on constrained Bayesian regression, classification, neural networks, and truncated sampling, highlighting acceleration in a stochastic quadratic model.
By Pervez Ali, Weihao Dong, Xiaoyu Wang
arXiv:2609. 17577v1 Announce Type: cross Abstract: We study Langevin diffusion and Langevin Monte Carlo (LMC) when the target distribution changes over time.
By Yuchen Xin, Jingxin Zhan, Zhihua Zhang
arXiv:2407.05790v4 Announce Type: replace-cross
Abstract: This paper introduces and analyses interacting underdamped Langevin algorithms, termed Kinetic Interacting Particle Langevin Monte Carlo (KIP...
By Paul Felix Valsecchi Oliva, O. Deniz Akyildiz