Graph Representational Learning: When Does More Expressivity Hurt Generalization?
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2605.06462v2 Announce Type: replace Abstract: Progress in graph learning is hindered by benchmark practices that conflate the contributions of node features and graph structure, making it hard...
arXiv:2510. 10101v4 Announce Type: replace Abstract: Understanding the interplay between generalization, expressivity, and the geometry of the input space is a central challenge in graph learning.
arXiv:2605. 15511v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have become the dominant framework for inductive graph-level learning.
Positional encodings (PEs) enhance the power of graph neural networks (GNNs), both theoretically and empirically. Two of the most popular families of PEs - spectral (e.
arXiv:2412. 19419v2 Announce Type: replace-cross Abstract: Graph neural networks are deep neural networks designed for graphs with attributes attached to nodes or edges.
Graph Hierarchical Recurrence (GHR) is a new framework that enhances Graph Neural Networks and Graph Transformers by jointly processing the input graph and a pooled hierarchical abstraction. It addresses the limitation of existing models in handling predictions that depend on correlations between distant graph regions, especially under out-of-range generalization where test instances require interactions beyond training distances. Across many long-range benchmarks, GHR consistently improves performance, achieving state‑of‑the‑art or competitive results on multiple tasks.