about
DRAGNN: A Transition-Based Framework for Dynamically Connected Neural Networks (arxiv.org)
3 points by Katydid on Mar 20, 2017 | hide | past | pdf | discuss on HN

In plain words: A new building block for neural networks decides its own connections on the fly from its own output, letting one framework form sequence, attention, and tree-shaped models. It parsed sentence structure more accurately and cheaply than the usual attention-based sequence model, and improved multi-task summarization.

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

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.

Lingpeng Kong, Chris Alberti, Daniel Andor, Ivan Bogatyy, David Weiss
arXiv:1703.04474 · cs.CL · submitted Mar 13, 2017
abstract · pdf · html · 10 pages; Submitted for review to ACL2017

add comment on HN