Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention

Tongzhou Liao, Barnab'as P'oczos
2/12/2026

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{liao2026greener,
  title  = {Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention},
  author = {Tongzhou Liao and Barnab'as P'oczos},
  year   = {2026},
  eprint = {2407.05649},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2407.05649},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.05649.svg)](https://codeofpaper.com/paper/2407.05649)

Discussion