English

Latent Template Induction with Gumbel-CRFs

Computation and Language 2020-12-01 v1 Artificial Intelligence Machine Learning

Abstract

Learning to control the structure of sentences is a challenging problem in text generation. Existing work either relies on simple deterministic approaches or RL-based hard structures. We explore the use of structured variational autoencoders to infer latent templates for sentence generation using a soft, continuous relaxation in order to utilize reparameterization for training. Specifically, we propose a Gumbel-CRF, a continuous relaxation of the CRF sampling algorithm using a relaxed Forward-Filtering Backward-Sampling (FFBS) approach. As a reparameterized gradient estimator, the Gumbel-CRF gives more stable gradients than score-function based estimators. As a structured inference network, we show that it learns interpretable templates during training, which allows us to control the decoder during testing. We demonstrate the effectiveness of our methods with experiments on data-to-text generation and unsupervised paraphrase generation.

Keywords

Cite

@article{arxiv.2011.14244,
  title  = {Latent Template Induction with Gumbel-CRFs},
  author = {Yao Fu and Chuanqi Tan and Bin Bi and Mosha Chen and Yansong Feng and Alexander M. Rush},
  journal= {arXiv preprint arXiv:2011.14244},
  year   = {2020}
}

Comments

NeurIPS 2020 camera ready

R2 v1 2026-06-23T20:34:26.295Z