Pith. sign in

Latent Normalizing Flows for Discrete Sequences

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Normalizing flows are a powerful class of generative models for continuous random variables, showing both strong model flexibility and the potential for non-autoregressive generation. These benefits are also desired when modeling discrete random variables such as text, but directly applying normalizing flows to discrete sequences poses significant additional challenges. We propose a VAE-based generative model which jointly learns a normalizing flow-based distribution in the latent space and a stochastic mapping to an observed discrete space. In this setting, we find that it is crucial for the flow-based distribution to be highly multimodal. To capture this property, we propose several normalizing flow architectures to maximize model flexibility. Experiments consider common discrete sequence tasks of character-level language modeling and polyphonic music generation. Our results indicate that an autoregressive flow-based model can match the performance of a comparable autoregressive baseline, and a non-autoregressive flow-based model can improve generation speed with a penalty to performance.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Discrete Markov Bridge

cs.LG · 2025-05-26 · conditional · novelty 6.0

Discrete Markov Bridge learns the forward rate matrix and the reverse score in a continuous-time Markov chain, achieving BPC 1.38 on Text8 and FID 11.63 on CIFAR-10.

citing papers explorer

Showing 1 of 1 citing paper.

  • Discrete Markov Bridge cs.LG · 2025-05-26 · conditional · none · ref 36 · internal anchor

    Discrete Markov Bridge learns the forward rate matrix and the reverse score in a continuous-time Markov chain, achieving BPC 1.38 on Text8 and FID 11.63 on CIFAR-10.