mlsanityData to 7 Oct 2026

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

arXiv 2112.05702 ↗First posted 10 Dec 2021cs.LG cs.CL cs.NEcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 50 references that are in the map. First posted on arXiv 10 Dec 2021.

Builds on

20 of 50 references.

References · 20

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  2. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  3. 2018Hierarchical Neural Story Generationcited by 1,182
  4. 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,036
  5. 2018Texygen: A Benchmarking Platform for Text Generation Modelscited by 484
  6. 2021How to Train Your Energy-Based Modelscited by 271
  7. 2019Facebook FAIR's WMT19 News Translation Task Submissioncited by 179
  8. 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 127
  9. 2020A Distributional Approach to Controlled Text Generationcited by 117
  10. 2020Residual Energy-Based Models for Text Generationcited by 95
  11. 2018CGMH: Constrained Sentence Generation by Metropolis-Hastings Samplingcited by 93
  12. 2021Oops I Took A Gradient: Scalable Sampling for Discrete Distributionscited by 92
8 more
  1. 2020Limitations of Autoregressive Models and Their Alternativescited by 54
  2. 2020Energy-Based Reranking: Improving Neural Machine Translation Using Energy-Based Modelscited by 44
  3. 2021Exposing the Implicit Energy Networks behind Masked Language Models via Metropolis--Hastingscited by 37
  4. 2019Distributional Reinforcement Learning for Energy-Based Sequential Modelscited by 17
  5. 2019Global Autoregressive Models for Data-Efficient Sequence Learningcited by 15
  6. 2021Joint Energy-based Model Training for Better Calibrated Natural Language Understanding Modelscited by 14
  7. 2020Do You Have the Right Scissors? Tailoring Pre-trained Language Models via Monte-Carlo Methodscited by 5
  8. 2020Language Generation via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approachcited by 3

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1.

2 papers.