Paper recorded by Signals 4 on 2026-10-27 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-27 on arXiv · recorded by Signals 4 on 2026-10-28
Category: cs.LG · 机器学习 · first seen 2026-10-28
Eigenvalues are a workhorse of graph machine learning: spectral clustering, spectral graph neural networks, and graph kernels all summarize a network by the eigenvalues of a matrix. These eigenvalues are almost always treated as a static list of numbers. When a graph changes, however, its eigenvalues move, and when the matrix is not symmetric, they move in the complex plane, where they can wind ar