Mirrored Langevin Dynamics

02/27/2018
by   Ya-Ping Hsieh, et al.
0

We generalize the Langevin Dynamics through the mirror descent framework for first-order sampling. The naïve approach of incorporating Brownian motion into the mirror descent dynamics, which we refer to as Symmetric Mirrored Langevin Dynamics (S-MLD), is shown to connected to the theory of Weighted Hessian Manifolds. The S-MLD, unfortunately, contains the hard instance of Cox--Ingersoll--Ross processes, whose discrete-time approximation exhibits slow convergence both theoretically and empirically. We then propose a new dynamics, which we refer to as the Asymmetric Mirrored Langevin Dynamics (A-MLD), that avoids the hurdles of S-MLD. In particular, we prove that discretized A-MLD implies the existence of a first-order sampling algorithm that sharpens the state-of-the-art Õ(ϵ^-6d^5) rate to Õ(ϵ^-2d), when the target distribution is strongly log-concave with compact support. For sampling on a simplex, A-MLD can transform certain non-log-concave sampling problems into log-concave ones. As a concrete example, we derive the first non-asymptotic Õ(ϵ^-4d^6) rate for first-order sampling of Dirichlet posteriors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/19/2020

Faster Convergence of Stochastic Gradient Langevin Dynamics for Non-Log-Concave Sampling

We establish a new convergence analysis of stochastic gradient Langevin ...
research
07/02/2020

Double-Loop Unadjusted Langevin Algorithm

A well-known first-order method for sampling from log-concave probabilit...
research
12/21/2020

Complexity of zigzag sampling algorithm for strongly log-concave distributions

We study the computational complexity of zigzag sampling algorithm for s...
research
02/18/2021

Convolution of a symmetric log-concave distribution and a symmetric bimodal distribution can have any number of modes

In this note, we show that the convolution of a discrete symmetric log-c...
research
04/26/2021

Wasserstein distance estimates for the distributions of numerical approximations to ergodic stochastic differential equations

We present a framework that allows for the non-asymptotic study of the 2...
research
03/20/2019

Rapid Convergence of the Unadjusted Langevin Algorithm: Log-Sobolev Suffices

We prove a convergence guarantee on the unadjusted Langevin algorithm fo...
research
02/04/2021

Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More

We show fully polynomial time randomized approximation schemes (FPRAS) f...

Please sign up or login with your details

Forgot password? Click here to reset