English

Subgradient Langevin Methods for Sampling from Non-smooth Potentials

Optimization and Control 2024-05-28 v3 Computation

Abstract

This paper is concerned with sampling from probability distributions π\pi on Rd\mathbb{R}^d admitting a density of the form π(x)eU(x)\pi(x) \propto e^{-U(x)}, where U(x)=F(x)+G(Kx)U(x)=F(x)+G(Kx) with KK being a linear operator and GG being non-differentiable. Two different methods are proposed, both employing a subgradient step with respect to GKG\circ K, but, depending on the regularity of FF, either an explicit or an implicit gradient step with respect to FF can be implemented. For both methods, non-asymptotic convergence proofs are provided, with improved convergence results for more regular FF. Further, numerical experiments are conducted for simple 2D examples, illustrating the convergence rates, and for examples of Bayesian imaging, showing the practical feasibility of the proposed methods for high dimensional data.

Keywords

Cite

@article{arxiv.2308.01417,
  title  = {Subgradient Langevin Methods for Sampling from Non-smooth Potentials},
  author = {Andreas Habring and Martin Holler and Thomas Pock},
  journal= {arXiv preprint arXiv:2308.01417},
  year   = {2024}
}
R2 v1 2026-06-28T11:46:49.743Z