arXiv:2403. 11199v2 Announce Type: replace-cross Abstract: Unitarity is a useful principle for stabilizing deep neural networks, but in graph neural networks (GNNs) instability is induced not only by learnable parameters but also by the graph propagation operator.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2608. 12514v1 Announce Type: new Abstract: Deep graph neural networks(GNNs) suffer from oversmoothing- a progressive collapse of node representation towards a low information subspace as network depth increases because the normalized graph propagation operator is repeatedly applied directly to the hidden representations.
arXiv:2602. 05352v3 Announce Type: replace Abstract: Modern neural networks have shown promise for solving partial differential equations over surfaces, often by discretizing the surface as a mesh and learning with a mesh-aware graph neural network.
arXiv:2607. 05017v1 Announce Type: cross Abstract: The performance of deep learning models crucially depends on the settings of hyperparameters like learning rate, initialization scale, and weight decay.
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.
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.
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.