An MCMC Method to Sample from Lattice Distributions
Anand Jerry George, Navin Kashyap

TL;DR
This paper presents a novel MCMC algorithm based on Metropolis-Hastings for sampling from lattice-supported distributions, enabling efficient sampling in high-dimensional lattice spaces with theoretical guarantees.
Contribution
The paper introduces a new MCMC method for lattice distributions using a pull-back measure and provides conditions for its uniform ergodicity.
Findings
Algorithm is uniformly ergodic under certain conditions.
Uses a piecewise sigmoidal distribution for sampling.
The method generalizes sampling on lattice structures.
Abstract
We introduce a Markov Chain Monte Carlo (MCMC) algorithm to generate samples from probability distributions supported on a -dimensional lattice , where is a full-rank matrix. Specifically, we consider lattice distributions in which the probability at a lattice point is proportional to a given probability density function, , evaluated at that point. To generate samples from , it suffices to draw samples from a pull-back measure defined on the integer lattice. The probability of an integer lattice point under is proportional to the density function . The algorithm we present in this paper for sampling from is based on the Metropolis-Hastings framework. In particular, we use as the proposal distribution and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
