Pith. sign in

hub

How Attentive are Graph Attention Networks?

39 Pith papers cite this work, alongside 42 external citations. Polarity classification is still indexing.

39 Pith papers citing it
42 external citations · Pith
abstract

Graph Attention Networks (GATs) are one of the most popular GNN architectures and are considered as the state-of-the-art architecture for representation learning with graphs. In GAT, every node attends to its neighbors given its own representation as the query. However, in this paper we show that GAT computes a very limited kind of attention: the ranking of the attention scores is unconditioned on the query node. We formally define this restricted kind of attention as static attention and distinguish it from a strictly more expressive dynamic attention. Because GATs use a static attention mechanism, there are simple graph problems that GAT cannot express: in a controlled problem, we show that static attention hinders GAT from even fitting the training data. To remove this limitation, we introduce a simple fix by modifying the order of operations and propose GATv2: a dynamic graph attention variant that is strictly more expressive than GAT. We perform an extensive evaluation and show that GATv2 outperforms GAT across 11 OGB and other benchmarks while we match their parametric costs. Our code is available at https://github.com/tech-srl/how_attentive_are_gats . GATv2 is available as part of the PyTorch Geometric library, the Deep Graph Library, and the TensorFlow GNN library.

hub tools

citation-role summary

background 2 method 1

citation-polarity summary

representative citing papers

Learning Dynamic Stability Landscapes in Synchronization Networks

cs.LG · 2026-05-22 · unverdicted · novelty 7.0

Introduces graph-to-image prediction of per-node dynamic stability landscapes in oscillator networks from topology, releases two 10k-graph datasets, and shows GNN-CNN models achieve good accuracy with cross-size generalization.

Effective Capacitance Modeling Using Graph Neural Networks

cs.LG · 2025-07-04 · unverdicted · novelty 7.0

GNN-Ceff is the first graph neural network model for post-layout effective capacitance prediction in VLSI circuits, delivering up to 929x speedup over serial state-of-the-art methods with improved accuracy on real benchmarks.

AlphaTransit: Learning to Design City-scale Transit Routes

cs.AI · 2026-05-27 · unverdicted · novelty 6.0

AlphaTransit pairs MCTS with a learned policy-value network to reach 54.6% and 82.1% service rates on a Bloomington transit benchmark, outperforming plain RL and plain MCTS baselines.

Random-Set Graph Neural Networks

cs.AI · 2026-05-12 · unverdicted · novelty 6.0

RS-GNNs predict random sets over classes using belief functions to jointly produce class probabilities and epistemic uncertainty estimates for graph nodes.

citing papers explorer

Showing 39 of 39 citing papers.