Sampling from Discrete Energy-Based Models with Quality/Efficiency Trade-offs

12/10/2021
by   Bryan Eikema, et al.
0

Energy-Based Models (EBMs) allow for extremely flexible specifications of probability distributions. However, they do not provide a mechanism for obtaining exact samples from these distributions. Monte Carlo techniques can aid us in obtaining samples if some proposal distribution that we can easily sample from is available. For instance, rejection sampling can provide exact samples but is often difficult or impossible to apply due to the need to find a proposal distribution that upper-bounds the target distribution everywhere. Approximate Markov chain Monte Carlo sampling techniques like Metropolis-Hastings are usually easier to design, exploiting a local proposal distribution that performs local edits on an evolving sample. However, these techniques can be inefficient due to the local nature of the proposal distribution and do not provide an estimate of the quality of their samples. In this work, we propose a new approximate sampling technique, Quasi Rejection Sampling (QRS), that allows for a trade-off between sampling efficiency and sampling quality, while providing explicit convergence bounds and diagnostics. QRS capitalizes on the availability of high-quality global proposal distributions obtained from deep learning models. We demonstrate the effectiveness of QRS sampling for discrete EBMs over text for the tasks of controlled text generation with distributional constraints and paraphrase generation. We show that we can sample from such EBMs with arbitrary precision at the cost of sampling efficiency.

READ FULL TEXT

page 21

page 23

research
10/07/2020

A Neural Network MCMC sampler that maximizes Proposal Entropy

Markov Chain Monte Carlo (MCMC) methods sample from unnormalized probabi...
research
09/30/2020

Efficient sampling from the Bingham distribution

We give a algorithm for exact sampling from the Bingham distribution p(x...
research
07/07/2023

On the Efficacy of Sampling Adapters

Sampling is a common strategy for generating text from probabilistic mod...
research
06/05/2023

Structured Voronoi Sampling

Recently, there has been a growing interest in the development of gradie...
research
06/20/2022

A Langevin-like Sampler for Discrete Distributions

We propose discrete Langevin proposal (DLP), a simple and scalable gradi...
research
06/04/2021

Exposing the Implicit Energy Networks behind Masked Language Models via Metropolis–Hastings

While recent work has shown that scores from models trained by the ubiqu...
research
02/27/2023

Efficient Informed Proposals for Discrete Distributions via Newton's Series Approximation

Gradients have been exploited in proposal distributions to accelerate th...

Please sign up or login with your details

Forgot password? Click here to reset