Papers › Subgradient Langevin Methods for Sampling from Non-smooth Potentials
Subgradient Langevin Methods for Sampling from Non-smooth Potentials
Andreas Habring, Martin Holler, Thomas Pock
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper is concerned with sampling from probability distributions π on ℝᵈ admitting a density of the form π(x) ∝e⁻ᵁ⁽ˣ⁾, 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 G∘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.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections