Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention
Tongzhou Liao, Barnab\'as P\'oczos

TL;DR
This paper introduces GRASS, a novel GNN architecture that combines encoding, rewiring, and attention mechanisms to improve structural information capture and long-range propagation, achieving state-of-the-art results.
Contribution
GRASS integrates RRWP encoding, graph rewiring with random regular graphs, and a new attention mechanism, advancing GNN performance on benchmark datasets.
Findings
Achieves state-of-the-art results on multiple benchmarks
Reduces mean absolute error by 20.3% on ZINC dataset
Effectively captures long-range structural information
Abstract
Graph Neural Networks (GNNs) have become important tools for machine learning on graph-structured data. In this paper, we explore the synergistic combination of graph encoding, graph rewiring, and graph attention, by introducing Graph Attention with Stochastic Structures (GRASS), a novel GNN architecture. GRASS utilizes relative random walk probabilities (RRWP) encoding and a novel decomposed variant (D-RRWP) to efficiently capture structural information. It rewires the input graph by superimposing a random regular graph to enhance long-range information propagation. It also employs a novel additive attention mechanism tailored for graph-structured data. Our empirical evaluations demonstrate that GRASS achieves state-of-the-art performance on multiple benchmark datasets, including a 20.3% reduction in mean absolute error on the ZINC dataset.
Peer Reviews
Decision·ICLR 2025 Poster
The motivation behind this paper is clear. The method justification is backed by evidence. Many types of baselines and ablation studies are considered when evaluating the model performance. The design goals are clear.
A lot of baseline performance numbers in tables are missing. I'm not sure if there are issues with running these models with the baselines. There are many aspects that could affect model design for given graph data. For example, homophily / heterophily properties; sparsity; clustering properties etc. could result in different model performances across designs. It's not clear what would be the type of data where the proposed method can achieve improvements. The algorithm description could bene
- The paper is well written and easy to follow. - The integration of RRWP encoding, random rewiring, and attention tailored to graph-structured data offers a plausible approach to addressing oversquashing and underreaching in GNNs. - The proposed D-RRWP variant is a computationally efficient alternative to traditional RRWP encoding, making GRASS more feasible for large graphs. - The results on Pascal-VOC and COCO-SP seems promising.
- Limited experimentation: Although GRASS is designed for scalability, the paper acknowledges that scalability testing on large, real-world graphs is limited due to resource constraints. Without large dataset evaluations, the real-world applicability to large-scale graph datasets remains unclear. For the currently used datasets, the memory or scalability does not present significant concerns since they are graph-level tasks with a small number of average nodes per graph. For example, the benchma
* Strong experimental results on various datasets. * The paper is well written. * Figures help communicate the ideas more clearly.
* Misses citation to [1], I think it should be discussed in related work and any similarities/difference should be made clear when it comes to the model architecture in [1] vs the author's proposed additive attention mechanism, which is claimed to be a novel contribution. [1] https://www.nature.com/articles/s41598-023-44224-1
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Cognitive Computing and Networks
MethodsSoftmax · Attention Is All You Need · Tanh Activation
