Modified log-Sobolev inequalities for strongly log-concave distributions

03/14/2019
by   Mary Cryan, et al.
0

We show that the modified log-Sobolev constant for a natural Markov chain which converges to an r-homogeneous strongly log-concave distribution is at least 1/r. As a consequence, we obtain an asymptotically optimal mixing time bound for this chain. Applications include the bases-exchange random walk in a matroid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/08/2018

Log-concave sampling: Metropolis-Hastings algorithms are fast!

We consider the problem of sampling from a strongly log-concave density ...
research
04/15/2020

Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees

We prove tight mixing time bounds for natural random walks on bases of m...
research
03/07/2023

Complete Log Concavity of Coverage-Like Functions

We introduce an expressive subclass of non-negative almost submodular se...
research
06/09/2023

Markov bases: a 25 year update

In this paper, we evaluate the challenges and best practices associated ...
research
09/23/2013

Efficient Sampling from Time-Varying Log-Concave Distributions

We propose a computationally efficient random walk on a convex body whic...
research
11/29/2018

Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition

A key task in Bayesian machine learning is sampling from distributions t...
research
07/13/2016

Fast Sampling for Strongly Rayleigh Measures with Application to Determinantal Point Processes

In this note we consider sampling from (non-homogeneous) strongly Raylei...

Please sign up or login with your details

Forgot password? Click here to reset