On Classification Thresholds for Graph Attention with Edge Features
Not on the map. Why?
Abstract (arXiv)
The recent years we have seen the rise of graph neural networks for prediction tasks on graphs. One of the dominant architectures is graph attention due to its ability to make predictions using weighted edge features and not only node features. In this paper we analyze, theoretically and empirically, graph attention networks and their ability of correctly labelling nodes in a classic classification task. More specifically, we study the performance of graph attention on the classic contextual stochastic block model (CSBM). In CSBM the nodes and edge features are obtained from a mixture of Gaussians and the edges from a stochastic block model. We consider a general graph attention mechanism that takes random edge features as input to determine the attention coefficients. We study two cases, in the first one, when the edge features are noisy, we prove that the majority of the attention coefficients are up to a constant uniform. This allows us to prove that graph attention with edge features is not better than simple graph convolution for achieving perfect node classification. Second, we prove that when the edge features are clean graph attention can distinguish intra- from inter-edges and this makes graph attention better than classic graph convolution.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 27 of its 41 references that are in the map. First posted on arXiv 18 Oct 2022.
Builds on
27 of 41 references.
References · 27
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 754
15 more
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 509
- 2017Community Detection and Stochastic Block Modelscited by 319
- 2015Diffusion-Convolutional Neural Networkscited by 268
- 2015Deep Convolutional Networks on Graph-Structured Datacited by 246
- 2020Generalization and Representational Limits of Graph Neural Networkscited by 218
- 2019What graph neural networks cannot learn: depth vs widthcited by 201
- 2019Understanding Attention and Generalization in Graph Neural Networkscited by 169
- 2018Contextual Stochastic Block Modelscited by 134
- 2021Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalizationcited by 70
- 2022Theory of Graph Neural Networks: Representation and Learningcited by 61
- 2022Generalization Analysis of Message Passing Neural Networks on Large Random Graphscited by 59
- 2014Covariate-assisted spectral clusteringcited by 29
- 2021On the Universality of Graph Neural Networks on Large Random Graphscited by 26
- 2022Graph Attention Retrospectivecited by 24
Built on by
Citing papers per year: 2023: 4; 2024: 1.
5 papers.
- 2023Optimality of Message-Passing Architectures for Sparse Graphscited by 13
- 2023What functions can Graph Neural Networks compute on random graphs? The role of Positional Encodingcited by 12
- 2023Optimal Inference in Contextual Stochastic Block Modelscited by 12
- 2023Neural-prior stochastic block modelcited by 4
- 2024Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networkscited by 0
- 2024Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networks18 Dec 2024
- 2023Optimal Inference in Contextual Stochastic Block Models6 Jun 2023
- 2023What functions can Graph Neural Networks compute on random graphs? The role of Positional Encoding24 May 2023
- 2023Optimality of Message-Passing Architectures for Sparse Graphs17 May 2023
- 2023Neural-prior stochastic block model17 Mar 2023