An MCMC Method to Sample from Lattice Distributions

by   Anand Jerry George, et al.

We introduce a Markov Chain Monte Carlo (MCMC) algorithm to generate samples from probability distributions supported on a d-dimensional lattice Λ = 𝐁ℤ^d, where 𝐁 is a full-rank matrix. Specifically, we consider lattice distributions P_Λ in which the probability at a lattice point is proportional to a given probability density function, f, evaluated at that point. To generate samples from P_Λ, it suffices to draw samples from a pull-back measure P_ℤ^d defined on the integer lattice. The probability of an integer lattice point under P_ℤ^d is proportional to the density function π = |(𝐁)|f∘𝐁. The algorithm we present in this paper for sampling from P_ℤ^d is based on the Metropolis-Hastings framework. In particular, we use π as the proposal distribution and calculate the Metropolis-Hastings acceptance ratio for a well-chosen target distribution. We can use any method, denoted by ALG, that ideally draws samples from the probability density π, to generate a proposed state. The target distribution is a piecewise sigmoidal distribution, chosen such that the coordinate-wise rounding of a sample drawn from the target distribution gives a sample from P_ℤ^d. When ALG is ideal, we show that our algorithm is uniformly ergodic if -log(π) satisfies a gradient Lipschitz condition.



There are no comments yet.


page 1

page 2

page 3

page 4

∙ 04/16/2020

Efficient Bernoulli factory MCMC for intractable likelihoods

Accept-reject based Markov chain Monte Carlo (MCMC) algorithms have trad...
∙ 07/26/2019

Analyzing MCMC Output

Markov chain Monte Carlo (MCMC) is a sampling-based method for estimatin...
∙ 09/06/2019

Plateau Proposal Distributions for Adaptive Component-wise Multiple-Try Metropolis

Markov chain Monte Carlo (MCMC) methods are sampling methods that have b...
∙ 10/03/2020

Random Coordinate Langevin Monte Carlo

Langevin Monte Carlo (LMC) is a popular Markov chain Monte Carlo samplin...
∙ 04/05/2021

Optimal Scaling of MCMC Beyond Metropolis

The problem of optimally scaling the proposal distribution in a Markov c...
∙ 01/12/2018

Deep Learning for Sampling from Arbitrary Probability Distributions

This paper proposes a fully connected neural network model to map sample...
∙ 07/20/2020

On the validity of complex Langevin method for path integral computations

The complex Langevin (CL) method is a classical numerical strategy to al...
This week in AI

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