How Attentive are Graph Attention Networks?

Explore this paper's citation graph

Summary

It is shown that GAT computes a very limited kind of attention: the ranking of the attention scores is unconditioned on the query node, and a simple fix is introduced by modifying the order of operations and proposed GATv2: a dynamic graph attention variant that is strictly more expressive than GAT.

Type
preprint
Published
2021-05-30
Cited by
2,025
References
72
Access
Open access

Keywords

Computer science, Graph, Theoretical computer science, Node (physics), Representation (politics)

References

Cited by

Related papers