A General Graph Spectral Wavelet Convolution via Chebyshev Order Decomposition

Spectral graph convolution, an important tool of data filtering on graphs, relies on two essential decisions: selecting spectral bases for signal transformation and parameterizing the kernel for frequency analysis. While recent techniques mainly focus on standard Fourier transform and vector-valued spectral functions, they fall short in flexibility to model signal distributions over large spatial ranges, and capacity of spectral function. In this paper, we present a novel wavelet-based graph convolution network, namely WaveGC, which integrates multi-resolution spectral bases and a matrix-valued filter kernel. Theoretically, we establish that WaveGC can effectively capture and decouple short-range and long-range information, providing superior filtering flexibility, surpassing existing graph wavelet neural networks. To instantiate WaveGC, we introduce a novel technique for learning general graph wavelets by separately combining odd and even terms of Chebyshev polynomials. This approach strictly satisfies wavelet admissibility criteria. Our numerical experiments showcase the consistent improvements in both short-range and long-range tasks. This underscores the effectiveness of the proposed model in handling different scenarios. Our code is available atthis https URL.

@article{liu2025_2405.13806,
  title={ A General Graph Spectral Wavelet Convolution via Chebyshev Order Decomposition },
  author={ Nian Liu and Xiaoxin He and Thomas Laurent and Francesco Di Giovanni and Michael M. Bronstein and Xavier Bresson },
  journal={arXiv preprint arXiv:2405.13806},
  year={ 2025 }
}