Graph Hierarchical Recurrence for Long-Range Generalization
Stefano Carotti, Marco Pacini, Alessio Gravina, Davide Bacciu, Bruno Lepri, Sebastiano Bontorin

TL;DR
The paper introduces Graph Hierarchical Recurrence (GHR), a new framework that enhances long-range dependency modeling and out-of-range generalization in graph neural networks by leveraging hierarchical pooling.
Contribution
GHR is a simple yet effective framework that improves long-range and out-of-range generalization in graph models with high parameter efficiency.
Findings
GHR outperforms existing models on long-range benchmarks.
GHR uses as little as 1% of parameters compared to state-of-the-art.
GHR enhances out-of-range generalization in graph tasks.
Abstract
Graph Neural Networks (GNNs) and Graph Transformers (GTs) are now a fundamental paradigm for graph learning, combining the representation-learning capabilities of deep models with the sample efficiency induced by their inductive biases. Despite their effectiveness, a large body of work has shown that these models still face fundamental limitations in tasks that require capturing correlations between distant regions of a graph. To address this issue, we introduce Graph Hierarchical Recurrence (GHR), a novel framework that operates jointly on the input graph and on a hierarchical abstraction obtained through pooling. We also show that the limitations of existing models are even more pronounced in out-of-range generalization, where test instances involve interactions over distances longer than those observed during training. By contrast, despite its simple design, GHR provides three key…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
