Pith. sign in

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

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

What makes a good feedforward computational graph?

cs.LG · 2025-02-10 · conditional · novelty 7.0

The authors define mixing time and minimax fidelity for feedforward graphs, use them to design a recursive sparse graph (FS) with polylogarithmic mixing time, and show it matches dense attention on parity and retrieval tasks.

citing papers explorer

Showing 1 of 1 citing paper.

  • What makes a good feedforward computational graph? cs.LG · 2025-02-10 · conditional · none · ref 24 · internal anchor

    The authors define mixing time and minimax fidelity for feedforward graphs, use them to design a recursive sparse graph (FS) with polylogarithmic mixing time, and show it matches dense attention on parity and retrieval tasks.