Gradient-based Constrained Sampling from Language Models

By Sachin Kumar, Biswajit Paria, Yulia Tsvetkov. 2022

77 citations recorded by the source corpus.

Large pretrained language models are successful at generating fluent text but are notoriously hard to controllably sample from. In this work, we study constrained sampling from such language models, i.e., generating text that satisfies user-defined constraints, while maintaining fluency and model’s performance in a downstream task. We propose MuCoLa—a sampling procedure that combines the log-likelihood of the language model with arbitrary (differentiable) constraints in a single energy function, and then generates samples in a non-autoregressive manner. Specifically, it initializes the entire output sequence with noise and follows a Markov chain defined by Langevin Dynamics using the gradients of this energy. We evaluate MuCoLa on text generation with soft and hard constraints as well as their combinations, obtaining significant improvements over competitive baselines for toxicity avoidance, sentiment control, and keyword-guided generation.

Subfields: Artificial Intelligence, Natural Language Processing, Generative Models

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yulia Tsvetkov
  2. Vidhisha Balachandran
  3. Sachin Kumar
  4. Antonios Anastasopoulos
  5. Lucille Njoo
  6. Micah Goldblum
  7. Jonas Geiping
  8. Yuxin Wen

In Natural Language Processing

  1. Yulia Tsvetkov
  2. Sachin Kumar
  3. Vidhisha Balachandran
  4. Antonios Anastasopoulos
  5. Lucille Njoo
  6. Micah Goldblum
  7. Tom Goldstein
  8. Jonas Geiping

In Generative Models

  1. Micah Goldblum
  2. Yulia Tsvetkov
  3. Tom Goldstein
  4. Sachin Kumar
  5. Jonas Geiping

Citations in the corpus