Gated Graph Sequence Neural Networks

By Yujia Li, Daniel Tarlow, Marc Brockschmidt, Richard S. Zemel. 2015

3,648 citations recorded by the source corpus.

Abstract: Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modify to use gated recurrent units and modern optimization techniques and then extend to output sequences. The result is a flexible and broadly useful class of neural network models that has favorable inductive biases relative to purely sequence-based models (e.g., LSTMs) when the problem is graph-structured. We demonstrate the capabilities on some simple AI (bAbI) and graph algorithm learning tasks. We then show it achieves state-of-the-art performance on a problem from program verification, in which subgraphs need to be matched to abstract data structures.

Subfields: Artificial Intelligence, Materials Chemistry, Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yoshua Bengio
  2. Mohit Bansal
  3. Percy Liang
  4. Jianfeng Gao
  5. Sergey Levine
  6. Quoc V. Le
  7. Ruslan Salakhutdinov
  8. Luke S. Zettlemoyer

In Materials Chemistry

  1. William L. Hamilton
  2. Jure Leskovec
  3. Tommi S. Jaakkola
  4. Regina Barzilay
  5. Rex Ying
  6. Wengong Jin
  7. Stephan Günnemann
  8. Max Welling

In Graph Learning

  1. William L. Hamilton
  2. Jure Leskovec
  3. Stephan Günnemann
  4. Matthias Fey
  5. Michael M. Bronstein
  6. Rex Ying
  7. Aleksandar Bojchevski
  8. Marinka Zitnik

Citations in the corpus