Spectral Graph Convolution
Overview
Spectral graph convolution studies how to transform node features using the frequency structure of a graph, often defined by its Laplacian. Common approaches use polynomial filters such as Chebyshev, Jacobi, or Hermite expansions to avoid costly eigendecomposition, alongside adaptive Laplacians, multi-scale bases, and filters for temporal or higher-order graph signals. These methods are used in settings including node classification, anomaly detection, time-series forecasting, and scientific modeling, with practical attention to scalability, robustness, and preserving high-frequency information. A central tension is whether spectral components provide reliable advantages over message-passing networks: theoretical claims and benchmark gains depend on the filter, implementation, training conditions, and task.
Latest papers
25 papers2 papers in the last four weeks, down 60% on the four weeks before. 0.0% of all new papers.