Cited by 2,061Topic ModelingSpeech Recognition and SynthesisNatural Language Processing Techniques

Generating Sentences from a Continuous Space

Open access
Bowman, Samuel R., Vilnis, Luke, Vinyals, Oriol, Dai, Andrew, Jozefowicz, Rafal, Bengio, Samy·2016·Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning

Abstract

The standard recurrent neural network language model (rnnlm) generates sentences one word at a time and does not work from an explicit global sentence representation.In this work, we introduce and study an rnn-based variational autoencoder generative model that incorporates distributed latent representations of entire sentences.This factorization allows it to explicitly model holistic properties of sentences such as style, topic, and high-level syntactic features.Samples from the prior over these sentence representations remarkably produce diverse and well-formed sentences through simple deterministic decoding.By examining paths through this latent space, we are able to generate coherent novel sentences that interpolate between known sentences.We present techniques for solving the difficult learning problem presented by this model, demonstrate its effectiveness in imputing missing words, explore many interesting properties of the model's latent sentence space, and present negative results on the use of the model in language modeling.but now , as they parked out front and owen stepped out of the car , he could see True: that the transition was complete .RNNLM: it , " i said .VAE: through the driver 's door .you kill

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/k16-1002

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Word dropout and KL annealing are crucial to prevent latent collapse.

    “As in [2], word dropout and KL annealing are crucial to prevent latent collapse.”

    From Multimodal Generative Models for Scalable Weakly-Supervised Learning (2018) · cites this paper as [2]

    Section 3.1, “Optimization challenges,” identifies the model’s tendency to ignore the latent variable and presents KL annealing and word dropout as techniques to mitigate it. The KL cost annealing and Section 6.1 passages describe improved use of the latent variable, but the paper does not establish that both techniques are crucial or that they reliably prevent collapse. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 36

  1. Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2015. Neural machine translation by jointly learning to align and translate. In Proc. ICLR.
  2. Justin Bayer and Christian Osendorfer. 2015. Learning stochastic recurrent networks. arXiv preprint arXiv:1411.7610. · arXiv
  3. Julian Besag. 1986. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society Series B (Methodological) pages 48-259.
  4. Junyoung Chung, Kyle Kastner, Laurent Dinh, Kratarth Goel, Aaron Courville, and Yoshua Bengio. 2015. A recurrent latent variable model for sequential data. In Proc. NIPS .
  5. Andrew M. Dai and Quoc V. Le. 2015. Semi- supervised sequence learning. In Proc. NIPS .
  6. Emily Denton, Soumith Chintala, Arthur Szlam, and Rob Fergus. 2015. Deep generative image models using a laplacian pyramid of adversarial networks. In Proc. NIPS .
  7. Bill Dolan, Chris Quirk, and Chris Brockett. 2004. Unsupervised construction of large para- phrase corpora: Exploiting massively parallel news sources. In Proc. COLING.
  8. Jeff Donahue, Lisa Anne Hendricks, Sergio Guadarrama, Marcus Rohrbach, Subhashini Venugopalan, Kate Saenko, and Trevor Darrell. 2015. Long-term recurrent convolutional net- works for visual recognition and description. In Proc. CVPR.
  9. Otto Fabius and Joost R. van Amersfoort. 2014. Variational recurrent auto-encoders. arXiv preprint arXiv:1412.6581. · arXiv
  10. Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In Proc. NIPS .
  11. Karol Gregor, Ivo Danihelka, Alex Graves, and Daan Wierstra. 2015. DRAW: A recurrent neu- ral network for image generation. In Proc. ICML.
  12. Arthur Gretton, Karsten M Borgwardt, Malte J Rasch, Bernhard Schölkopf, and Alexander Smola. 2012. A kernel two-sample test. JMLR 13(1):723-773.
  13. Mohit Iyyer, Jordan Boyd-Graber, and Hal Daumé III. 2014. Generating sentences from seman- tic vector space representations. In Proc. NIPS Workshop on Learning Semantics.
  14. Mohit Iyyer, Varun Manjunatha, Jordan Boyd- Graber, and Hal Daumé III. 2015. Deep un- ordered composition rivals syntactic methods for text classification. In Proc. ACL.
  15. Michael Kearns, Yishay Mansour, and Andrew Y Ng. 1998. An information-theoretic analysis of hard and soft assignment methods for clustering. In Learning in graphical models, Springer, pages 495-520.
  16. Yoon Kim. 2014. Convolutional neural networks for sentence classification. In Proc. EMNLP .
  17. Diederik P. Kingma and Max Welling. 2015. Auto- encoding variational bayes. In Proc. ICLR.
  18. Ryan Kiros, Yukun Zhu, Ruslan Salakhutdinov, Richard S Zemel, Antonio Torralba, Raquel Ur- tasun, and Sanja Fidler. 2015. Skip-thought vec- tors. In Proc. NIPS .
  19. Ankit Kumar, Ozan Irsoy, Jonathan Su, James Bradbury, Robert English, Brian Pierce, Pe- ter Ondruska, Ishaan Gulrajani, and Richard Socher. 2016. Ask me anything: Dynamic mem- ory networks for natural language processing. In Proc. ICML.
  20. Quoc V. Le and Tomáš Mikolov. 2014. Distributed representations of sentences and documents. In Proc. ICML.
  21. Jiwei Li, Minh-Thang Luong, and Dan Jurafsky. 2015a. A hierarchical neural autoencoder for paragraphs and documents. In Proc. ACL.
  22. Xin Li and Dan Roth. 2002. Learning question classifiers. In Proc. COLING.
  23. Yujia Li, Kevin Swersky, and Richard Zemel. 2015b. Generative moment matching networks. In Proc. ICML.
  24. Junhua Mao, Wei Xu, Yi Yang, Jiang Wang, Zhi- heng Huang, and Alan Yuille. 2015. Deep cap- tioning with multimodal recurrent neural net- works (m-RNN). In Proc. ICLR.
  25. Mitchell P Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large an- notated corpus of English: The Penn Treebank. Computational linguistics 19(2):313-330.
  26. Yishu Miao, Lei Yu, and Phil Blunsom. 2016. Neu- ral variational inference for text processing. In Proc. ICML.
  27. Tomáš Mikolov, Stefan Kombrink, Lukáš Burget, Jan Honza Černockỳ, and Sanjeev Khudanpur. 2011. Extensions of recurrent neural network language model. In Proc. ICASSP .
  28. Tapani Raiko, Mathias Berglund, Guillaume Alain, and Laurent Dinh. 2015. Techniques for learning binary stochastic feedforward neu- ral networks. In Proc. ICLR.
  29. Danilo J. Rezende and Shakir Mohamed. 2015. Variational inference with normalizing flows. In Proc. ICML.
  30. Danilo J. Rezende, Shakir Mohamed, and Daan Wierstra. 2014. Stochastic backpropagation and approximate inference in deep generative mod- els. In Proc. ICML.
  31. Richard Socher, Eric H Huang, Jeffrey Pennin, Christopher D. Manning, and Andrew Y. Ng. 2011. Dynamic pooling and unfolding recursive autoencoders for paraphrase detection. In Proc. NIPS .
  32. Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: A simple way to prevent neural networks from overfitting. JMLR 15(1):1929-1958.
  33. Rupesh Kumar Srivastava, Klaus Greff, and Jürgen Schmidhuber. 2015. Training very deep networks. In Proc. NIPS .
  34. Ilya Sutskever, Oriol Vinyals, and Quoc V. Le. 2014. Sequence to sequence learning with neural networks. In Proc. NIPS .
  35. Lucas Theis and Matthias Bethge. 2015. Gener- ative image modeling using spatial LSTMs. In Proc. NIPS .
  36. Han Zhao, Zhengdong Lu, and Pascal Poupart. 2015. Self-adaptive hierarchical sentence model. In Proc. IJCAI .

Cited by

Sorted by citations

Authors
Bowman, S. R., Vilnis, L., Vinyals, O., Dai, A., Jozefowicz, R., & Bengio, S.
Affiliations
  • Stanford University (US)
  • University of Massachusetts Amherst (US)
  • Alphabet (United States) (US)
  • Google (United States) (US)
Venue
Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning
Published
2016
Pages
10-21
OpenAlex
W2210838531
Cited by
2,061
References
3
Citations by year
2026: 68 · 2025: 95 · 2024: 136 · 2023: 165 · 2022: 243 · 2021: 364 · 2020: 358 · 2019: 341 · 2018: 187 · 2017: 83 · 2016: 21
FWCI
113.69
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Conference on Computational Natural Language Learning (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
sentence generation, variational autoencoder, recurrent neural network language models, continuous latent space, deterministic decoding

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review