Are Graph Attention Networks Able to Model Structural Information?
Not on the map. Why?
Abstract (arXiv)
Graph Attention Networks (GATs) have emerged as powerful models for learning expressive representations from such data by adaptively weighting neighboring nodes through attention mechanisms. However, most existing approaches primarily rely on node attributes and direct neighborhood connections, often overlooking rich structural patterns that capture higher-order topological information crucial for many real-world datasets. In this work, we present the Graph Structure Attention Network (GSAT), a novel extension of GAT that jointly integrates attribute-based and structure-based representations for more effective graph learning. GSAT incorporates structural features derived from anonymous random walks (ARWs) and graph kernels to encode local topological information, enabling attention mechanisms to adapt based on the underlying graph structure. This design enhances the model's ability to discern meaningful relational dependencies within complex data. Comprehensive experiments on standard graph classification and regression benchmarks demonstrate that GSAT achieves consistent improvements over state-of-the-art graph learning methods, highlighting the value of incorporating structural context for representation learning on graphs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 27 May 2025.
Builds on
22 of 32 references.
References · 22
- 2017Graph Attention Networkscited by 8,923
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 652
- 2017Representation Learning on Graphs: Methods and Applicationscited by 457
- 2019Self-Attention Graph Poolingcited by 421
- 2017struc2vec: Learning Node Representations from Structural Identitycited by 215
- 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
- 2019ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representationscited by 156
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 98
10 more
- 2021Generalized Jensen-Shannon Divergence Loss for Learning with Noisy Labelscited by 74
- 2019Edge Contraction Pooling for Graph Neural Networkscited by 53
- 2022KerGNNs: Interpretable Graph Neural Networks with Graph Kernelscited by 50
- 2018Anonymous Walk Embeddingscited by 46
- 2022RAW-GNN: RAndom Walk Aggregation based Graph Neural Networkcited by 25
- 2024Learning Long Range Dependencies on Graphs via Random Walkscited by 18
- 2021Graph Kernel Neural Networkscited by 13
- 2019A Quantum-inspired Similarity Measure for the Analysis of Complete Weighted Graphscited by 9
- 2019Rethinking Kernel Methods for Node Representation Learning on Graphscited by 7
- 2022Representation Learning on Heterostructures via Heterogeneous Anonymous Walkscited by 1
Built on by
Not cited yet.