Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited

Designing spectral convolutional networks is a challenging problem in graph learning. ChebNet, one of the early attempts, approximates the spectral graph convolutions using Chebyshev polynomials.