DASH
Repository logo
Communities & Collections
Browse DASH
DASH Stories
Statistics
  1. Home
  2. Faculty of Arts and Sciences
  3. FAS Scholarly Articles
  4. Tree-structured decoding with doubly-recurrent neural networks

Tree-structured decoding with doubly-recurrent neural networks

Open/View files
ICLR2017_Tree.pdf (481.2 KB)
poster 3.pdf (533.69 KB)
Date
April 24, 2017
Author(s)
Jaakkola, Tommi S.
Publisher
ICLR
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
D. Alvarez-Melis and T. S. Jaakkola. "Tree-structured decoding with doubly-recurrent neural networks". In: Proc. International Conference on Learning Representations (ICLR). ICLR (Toulon, France, 2017). 2017.
Abstract
We propose a neural network architecture for generating tree-structured objects from encoded representations. The core of the method is a doubly recurrent neural network model comprised of separate width and depth recurrences that are combined inside each cell (node) to generate an output. The topology of the tree is modeled explicitly together with the content. That is, in response to an encoded vector representation, co-evolving recurrences are used to realize the associated tree and the labels for the nodes in the tree. We test this architecture in an encoder-decoder framework, where we train a network to encode a sentence as a vector, and then generate a tree structure from it. The experimental results show the effectiveness of this architecture at recovering latent tree structure in sequences and at mapping sentences to simple functional programs.
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service
URI
https://dash.harvard.edu/handle/1/42717551
Collection
FAS Scholarly Articles
Metrics
Repository logo
  • CONTACT US
  • OSRDS
  • ABOUT DASH
  • DEPOSITING TO DASH
  • TERMS OF USE
  • REQUEST A WAIVER
  • TAKE DOWN POLICY
  • NAME CHANGE POLICY
  • HARVARD OA POLICIES
  • DASH SUBMITTER AGREEMENT
  • Accessibility
  • Privacy
Creative Commons License BY
Creative Commons Attribution 4.0 International License

Except where otherwise noted, this work is subject to a Creative Commons Attribution 4.0 International License,
which allows anyone to share and adapt our material as long as proper attribution is given.
For details and exceptions, see the Harvard Library Copyright Policy
©2024 Presidents and Fellows of Harvard College.