An Efficient Sampling Algorithm for Non-smooth Composite Potentials

10/01/2019 ∙ by Wenlong Mou, et al. ∙ 24

We consider the problem of sampling from a density of the form p(x) ∝(-f(x)- g(x)), where f: R^d →R is a smooth and strongly convex function and g: R^d →R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework, and prove that it mixes to within TV distance ε of the target density in at most O(d log (d/ε)) iterations. This guarantee extends previous results on sampling from distributions with smooth log densities (g = 0) to the more general composite non-smooth case, with the same mixing time up to a multiple of the condition number. Our method is based on a novel proximal-based proposal distribution that can be efficiently computed for a large class of non-smooth functions g.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.