Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Graph Attention Networks

About

We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations. By stacking layers in which nodes are able to attend over their neighborhoods' features, we enable (implicitly) specifying different weights to different nodes in a neighborhood, without requiring any kind of costly matrix operation (such as inversion) or depending on knowing the graph structure upfront. In this way, we address several key challenges of spectral-based graph neural networks simultaneously, and make our model readily applicable to inductive as well as transductive problems. Our GAT models have achieved or matched state-of-the-art results across four established transductive and inductive graph benchmarks: the Cora, Citeseer and Pubmed citation network datasets, as well as a protein-protein interaction dataset (wherein test graphs remain unseen during training).

Petar Veli\v{c}kovi\'c, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\`o, Yoshua Bengio• 2017

Related benchmarks

TaskDatasetResultRank
Graph ClassificationPROTEINS
Accuracy76.8
1252
Node ClassificationCora
Accuracy88.4
1215
Graph ClassificationMUTAG
Accuracy89.4
1103
Node ClassificationCiteseer
Accuracy80.52
1037
Node ClassificationCora (test)
Mean Accuracy88.96
951
Node ClassificationCiteseer (test)
Accuracy0.7655
945
Node ClassificationChameleon
Accuracy68.49
867
Node ClassificationPubmed
Accuracy88.73
865
Node ClassificationWisconsin
Accuracy84.12
864
Node ClassificationCornell
Accuracy74
851
Showing 10 of 1722 rows
...

Other info

Code

Follow for update