pith. sign in

hub

Gated Graph Sequence Neural Networks

15 Pith papers cite this work. Polarity classification is still indexing.

15 Pith papers citing it
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.

hub tools

citation-role summary

background 1

citation-polarity summary

roles

background 1

polarities

background 1

representative citing papers

Heterogeneous Sheaf Neural Networks

cs.LG · 2024-09-12 · unverdicted · novelty 7.0

HetSheaf applies cellular sheaves and type-conditioned restriction maps to heterogeneous graphs, plus SheafPool for basis-invariant graph-level representations, delivering competitive accuracy with substantially reduced parameter counts.

HONEM: Learning Embedding for Higher Order Networks

cs.LG · 2019-08-15 · unverdicted · novelty 6.0

HONEM learns embeddings for higher-order networks capturing non-Markovian dependencies and outperforms baselines on node classification, reconstruction, link prediction, and visualization.

Learning Blended, Precise Semantic Program Embeddings

cs.SE · 2019-07-03 · unverdicted · novelty 6.0

LIGER blends symbolic and concrete traces to learn precise semantic program embeddings, outperforming syntax-based models on CoSET classification and code2seq on method name prediction while using fewer executions.

Graph Star Net for Generalized Multi-Task Learning

cs.SI · 2019-06-21 · unverdicted · novelty 6.0

GraphStar is a new GNN that adds star nodes and relay attention to achieve non-local representations for node, graph, and link tasks, claiming 2-5% gains over prior SOTA on benchmarks.

citing papers explorer

Showing 15 of 15 citing papers.