arXiv Machine Learning By Junru Zhou, Cai Zhou, Xiyuan Wang, Pan Li, Muhan Zhang

Towards Stable, Globally Expressive Graph Representations with Laplacian Eigenvectors

Read the original on arXiv Machine Learning →

arXiv:2410. 09737v2 Announce Type: replace Abstract: A popular way to improve the expressive power of graph neural networks (GNNs) is to use Laplacian eigenvectors as additional node features, since they can serve both as structural identifiers and global coordinates of nodes.

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

arXiv Machine Learning
Jun 16

Graph Learning Should Move Beyond Restrictive Views of Spectral and Message-Passing GNNs

arXiv:2602. 10031v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral GNNs, reflecting two largely separate research traditions in machine learning and signal processing.

By Antonis Vasileiou, Juan Cervino, Pascal Frossard, Charilaos I. Kanatsoulis, Christopher Morris, Michael T. Schaub, Pierre Vandergheynst, Zhiyang Wang, Guy Wolf, Ron Levie
arXiv Machine Learning
Jul 13

Group Invariant Spectral Embedding

arXiv:2607. 08987v1 Announce Type: new Abstract: Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures.

By Yeari Vigder, Paulina Hoyos, David Thong, Joakim and\'en, Joe Kileel, Amit Moscovich
arXiv Machine Learning
Jul 1

The Impact of Dimensionality on the Stability of Node Embeddings

arXiv:2604. 08492v2 Announce Type: replace Abstract: Previous work has shown that node embedding methods can produce different representations and downstream predictions across repeated training runs, even when trained on the same data with identical hyperparameters.

By Tobias Schumacher, Simon Reichelt, Markus Strohmaier