Methods › Graphs › Graph Models › GATv2

Graph Attention Network v2

GATv2

9 papers tagged archive 2025-07-28

Introduced by Shaked Brody et al. in How Attentive are Graph Attention Networks?

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The GATv2 operator from the “How Attentive are Graph Attention Networks?” paper, which fixes the static attention problem of the standard GAT layer: since the linear layers in the standard GAT are applied right after each other, the ranking of attended nodes is unconditioned on the query node. In contrast, in GATv2, every node can attend to any other node.

GATv2 scoring function:

e_(i,j) =a^⊤LeakyReLU(W[hᵢ ‖ hⱼ])

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 9 in the graph, strongest link: official). This answer is about arXiv:2105.14491, the paper the archive credits with this method.

Origin paper of this answer, arXiv:2105.14491 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified (of 16 harvested samples) · 1 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 9 · with a code link: 6 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 9 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 9 of 9, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 21 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Graph Attention5
Graph Classification2
Graph Neural Network2
Anomaly Detection1
Deep Learning1
Demand Forecasting1
Drug Discovery1
Graph Learning1
Graph Property Prediction1
Graph Regression1
Link Prediction1
Molecular Property Prediction1
Node Classification1
Node Property Prediction1
Product Categorization1
Product Relation Classification1
Product Relation Detection1
Production Forecasting1
Representation Learning1
Specificity1

Usage over time archive 2025-07-28

Papers per year tagged with GATv2: 2021 to 2024, peak 4 4 0 2021: 1 paper 2021 2022: 2 papers 2022 2023: 2 papers 2023 2024: 4 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (9 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections