Subgradient Langevin Methods for Sampling from Non-smooth Potentials
Not on the map. Why?
Abstract (arXiv)
This paper is concerned with sampling from probability distributions π on ℝd admitting a density of the form π(x) propto e-U(x), where U(x)=F(x)+G(Kx) with K being a linear operator and G being non-differentiable. Two different methods are proposed, both employing a subgradient step with respect to Gcirc K, but, depending on the regularity of F, either an explicit or an implicit gradient step with respect to F can be implemented. For both methods, non-asymptotic convergence proofs are provided, with improved convergence results for more regular F. 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.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Aug 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 5; 2026: 5.
11 papers.
- 2024Proximal Interacting Particle Langevin Algorithmscited by 8
- 2025Diffusion at Absolute Zero: Langevin Sampling Using Successive Moreau Envelopes [conference paper]cited by 6
- 2025The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptionscited by 4
- 2025Beyond Scores: Proximal Diffusion Modelscited by 3
- 2025Anchored Langevin Algorithmscited by 2
- 2025Preconditioned Regularized Wasserstein Proximal Samplingcited by 1
- 2026DC-LA: Difference-of-Convex Langevin Algorithmcited by 1
- 2026A proximal gradient algorithm for composite log-concave samplingcited by 1
- 2026Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Samplingcited by 1
- 2026Bridging data-driven priors via the score function for posterior sampling -- Comparative review and experimental studycited by 0
- 2026Muon meets Tamed Langevin: Momentum Preconditioning beyond Convex and gradient-Lipschitz Potentialscited by 0
- 2026Muon meets Tamed Langevin: Momentum Preconditioning beyond Convex and gradient-Lipschitz Potentials1 Oct 2026
- 2026Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling13 Aug 2026
- 2026Bridging data-driven priors via the score function for posterior sampling -- Comparative review and experimental study11 Jun 2026
- 2026A proximal gradient algorithm for composite log-concave sampling12 May 2026
- 2026DC-LA: Difference-of-Convex Langevin Algorithm30 Jan 2026
- 2025Anchored Langevin Algorithms23 Sep 2025
- 2025Preconditioned Regularized Wasserstein Proximal Sampling1 Sep 2025
- 2025Beyond Scores: Proximal Diffusion Models11 Jul 2025
- 2025The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptions5 Feb 2025
- 2025Diffusion at Absolute Zero: Langevin Sampling Using Successive Moreau Envelopes [conference paper]3 Feb 2025
- 2024Proximal Interacting Particle Langevin Algorithms20 Jun 2024