Subgradient Langevin Methods for Sampling from Non-smooth Potentials

08/02/2023
by   Andreas Habring, et al.
0

This paper is concerned with sampling from probability distributions π on ℝ^d admitting a density of the form π(x) ∝ 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 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.

READ FULL TEXT

page 23

page 24

research
05/22/2019

Analytic regularity and stochastic collocation of high dimensional Newton iterates

In this paper we introduce concepts from uncertainty quantification (UQ)...
research
12/17/2020

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in re...
research
12/20/2019

Levin methods for highly oscillatory integrals with singularities

In this paper, new Levin methods are presented for calculating oscillato...
research
10/06/2020

Efficient and fast predictor-corrector method for solving nonlinear fractional differential equations with non-singular kernel

Efficient and fast predictor-corrector methods are proposed to deal with...
research
12/15/2021

On optimal convergence rates for discrete minimizers of the Gross-Pitaevskii energy in LOD spaces

In this paper we revisit a two-level discretization based on the Localiz...
research
05/30/2019

Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm

We present a novel algorithm to estimate the barycenter of arbitrary pro...
research
11/03/2022

Geometry and convergence of natural policy gradient methods

We study the convergence of several natural policy gradient (NPG) method...

Please sign up or login with your details

Forgot password? Click here to reset