arXiv Machine Learning By Samra Sana, Giorgio Mantica, Saul Imbrici

Graph Neural Networks for Scalable and Transferable Node Centrality Approximation

Read the original on arXiv Machine Learning →

arXiv:2607. 09372v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) provide a learning-based framework for approximating graph quantities that are expensive to compute exactly.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Aug 3

CoRe-GNN: Multilevel Message passing on Coarsened graphs

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 AI
Aug 10

Cluster Attention for Graph Machine Learning

arXiv:2604. 07492v2 Announce Type: replace-cross Abstract: Message Passing Neural Networks have recently become the most popular approach to graph machine learning tasks; however, their receptive field is limited by the number of message passing layers.

By Oleg Platonov, Liudmila Prokhorenkova