Multi-hop Attention Graph Neural Network
Guangtao Wang, Rex Ying, Jing Huang, Jure Leskovec

TL;DR
MAGNA introduces a multi-hop attention mechanism in GNNs that diffuses attention scores across the network, capturing large-scale structural information and improving performance on various graph tasks.
Contribution
The paper proposes MAGNA, a novel GNN model that incorporates multi-hop context via diffusion of attention scores, enhancing structural understanding and performance.
Findings
Achieves state-of-the-art results on node classification benchmarks.
Outperforms previous models on knowledge graph completion tasks.
Demonstrates effective large-scale structural information capture.
Abstract
Self-attention mechanism in graph neural networks (GNNs) led to state-of-the-art performance on many graph representation learning tasks. Currently, at every layer, attention is computed between connected pairs of nodes and depends solely on the representation of the two nodes. However, such attention mechanism does not account for nodes that are not directly connected but provide important network context. Here we propose Multi-hop Attention Graph Neural Network (MAGNA), a principled way to incorporate multi-hop context information into every layer of attention computation. MAGNA diffuses the attention scores across the network, which increases the receptive field for every layer of the GNN. Unlike previous approaches, MAGNA uses a diffusion prior on attention values, to efficiently account for all paths between the pair of disconnected nodes. We demonstrate in theory and experiments…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Topic Modeling
MethodsGraph Neural Network · Diffusion
