Discrete Flows: Invertible Generative Models of Discrete Data

By Dustin Tran, Keyon Vafa, Kumar Krishna Agrawal, Laurent Dinh, Ben Poole. 2019

133 citations recorded by the source corpus.

While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to discrete events---and under a simple change-of-variables formula not requiring log-determinant-Jacobian computations. Discrete flows have numerous applications. We consider two flow architectures: discrete autoregressive flows that enable bidirectionality, allowing, for example, tokens in text to depend on both left-to-right and right-to-left contexts in an exact language model; and discrete bipartite flows that enable efficient non-autoregressive generation as in RealNVP. Empirically, we find that discrete autoregressive flows outperform autoregressive baselines on synthetic discrete distributions, an addition task, and Potts models; and bipartite flows can obtain competitive performance with autoregressive baselines on character-level language modeling for Penn Tree Bank and text8.

Subfields: Artificial Intelligence, 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. Yoshua Bengio
  2. Sergey Levine
  3. Stefano Ermon
  4. Pieter Abbeel
  5. Ruslan Salakhutdinov
  6. Quoc V. Le
  7. Mohit Bansal
  8. Max Welling

In Generative Models

  1. Stefano Ermon
  2. Diederik P. Kingma
  3. Max Welling
  4. Yoshua Bengio
  5. Arash Vahdat
  6. Ying Nian Wu
  7. Jiaming Song
  8. Yang Song

Citations in the corpus