Pith. sign in

On Measuring Long-Range Interactions in Graph Neural Networks

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
abstract

Long-range graph tasks -- those dependent on interactions between distant nodes -- are an open problem in graph neural network research. Real-world benchmark tasks, especially the Long Range Graph Benchmark, have become popular for validating the long-range capability of proposed architectures. However, this is an empirical approach that lacks both robustness and theoretical underpinning; a more principled characterization of the long-range problem is required. To bridge this gap, we formalize long-range interactions in graph tasks, introduce a range measure for operators on graphs, and validate it with synthetic experiments. We then leverage our measure to examine commonly used tasks and architectures, and discuss to what extent they are, in fact, long-range. We believe our work advances efforts to define and address the long-range problem on graphs, and that our range measure will aid evaluation of new datasets and architectures.

citation-role summary

background 1

citation-polarity summary

years

2026 3

roles

background 1

polarities

background 1

representative citing papers

Ramanujan Graph Rewiring with Non Negative Resistance Curvature

cs.LG · 2026-06-19 · unverdicted · novelty 4.0

Introduces Ramanujan Propagation as a graph rewiring method for GNNs that leverages Ramanujan graphs to ensure non-negative resistance curvature while preserving local connectivity and outperforming prior rewiring techniques.

citing papers explorer

Showing 3 of 3 citing papers.