Gated Graph Sequence Neural Networks

by   Yujia Li, et al.

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.


page 1

page 2

page 3

page 4


Residual Gated Graph ConvNets

Graph-structured data such as functional brain networks, social networks...

Inductive Graph Representation Learning with Recurrent Graph Neural Networks

In this paper, we study the problem of node representation learning with...

Modelling Identity Rules with Neural Networks

In this paper, we show that standard feed-forward and recurrent neural n...

Structured Neural Summarization

Summarization of long sequences into a concise statement is a core probl...

Graph-to-Sequence Learning using Gated Graph Neural Networks

Many NLP applications can be framed as a graph-to-sequence learning prob...

GRAPHSPY: Fused Program Semantic-Level Embedding via Graph Neural Networks for Dead Store Detection

Production software oftentimes suffers from the issue of performance ine...

Perceiver IO: A General Architecture for Structured Inputs Outputs

The recently-proposed Perceiver model obtains good results on several do...

Please sign up or login with your details

Forgot password? Click here to reset