arXiv:2607. 27479v1 Announce Type: new Abstract: The information flow in the graph neural networks (GNNs) is fundamentally constrained by over-squashing, where structural bottlenecks impede long range information propagation.
The information flow in the graph neural networks (GNNs) is fundamentally constrained by over-squashing, where structural bottlenecks impede long range information propagation. Graph-rewiring methods, which modify graph topology, have been extensively used to alleviate this.
Scaffold is a new unsupervised graph sparsification framework for graph neural networks that uses support graph theory preconditioners to jointly control dilation and congestion, thereby preserving short communication paths while avoiding bottlenecks. It achieves superior aggregate ranking across 19 homophilic and heterophilic benchmarks, recovering or closely approaching full‑graph GNN performance with only 10%–50% of the original edges. The method reduces memory usage to less than half and cuts end‑to‑end training time, including sparsification overhead.
arXiv:2606. 21333v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have emerged as a powerful paradigm for learning on graph-structured data by iteratively propagating and aggregating information across edges.
The paper introduces an asynchronous message‑passing framework for Graph Neural Networks to mitigate oversquashing, a problem where distant nodes cannot effectively communicate due to structural bottlenecks. Unlike conventional synchronous updates, the method updates a centrality‑guided batch of nodes at each layer, allowing information to propagate sequentially and reducing the need for increased channel capacity. Experiments on six standard and two long‑range graph classification benchmarks show notable performance gains, including 5 % improvement on REDDIT‑BINARY and 4 % on Peptides‑struct.
arXiv:2608. 02128v1 Announce Type: new Abstract: Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers.
arXiv:2501.08547v2 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) have been widely adopted for their ability to compute expressive node representations in graph datasets. However...
Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations.
arXiv:2606. 05046v1 Announce Type: new Abstract: We introduce Graph Cascades, a mesoscopic rewiring strategy for Graph Neural Networks (GNNs) and Graph Transformers (GTs) that captures intermediate-scale graph structure beyond purely local edges or fully global attention.
DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
HyPE-GT introduces a framework that generates learnable hyperbolic positional encodings for Graph Transformers, enabling the capture of complex hierarchical relationships in graph-structured data. Unlike traditional Euclidean encodings, HyPE’s hyperbolic encodings can be selected to suit specific downstream tasks and help mitigate oversmoothing in deep Graph Neural Networks. Experiments on molecular benchmarks and large-scale Open Graph Benchmark datasets demonstrate improved performance, while additional tests on Coauthor and Copurchase networks confirm HyPE’s effectiveness in controlling oversmoothing.
arXiv:2602. 09258v2 Announce Type: replace Abstract: Deployed graph neural networks (GNNs) are frozen at deployment yet must fit clean data, generalize under distribution shifts, and remain stable to perturbations.