HackerPapers

arXiv:1703.04474cs.CL

DRAGNN: A Transition-based Framework for Dynamically Connected Neural Networks

Lingpeng Kong, Chris Alberti, Daniel Andor, Ivan Bogatyy, David Weiss

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

In this work, we present a compact, modular framework for constructing novel recurrent neural architectures. Our basic module is a new generic unit, the Transition Based Recurrent Unit (TBRU). In addition to hidden layer activations, TBRUs have discrete state dynamics that allow network connections to be built dynamically as a function of intermediate activations. By connecting multiple TBRUs, we can extend and combine commonly used architectures such as sequence-to-sequence, attention mechanisms, and re-cursive tree-structured models. A TBRU can also serve as both an encoder for downstream tasks and as a decoder for its own task simultaneously, resulting in more accurate multi-task learning. We call our approach Dynamic Recurrent Acyclic Graphical Neural Networks, or DRAGNN. We show that DRAGNN is significantly more accurate and efficient than seq2seq with attention for syntactic dependency parsing and yields more accurate multi-task learning for extractive summarization tasks.

arXiv comments
10 pages; Submitted for review to ACL2017
Journal reference
DOI
Subjects
cs.CLComputation and Language

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jan 2018 to Jan 2018. Found in 1 HN submission from Mar 2017 to Mar 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. One model to learn them all 1 comment
    • Reminds me allot of DRAGNN: https://arxiv.org/pdf/1703.04474.pdf Both are multi-task endeavors with novel encoding techniques.

      zbyte64View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.