– tags: Graph Signal Processing

ChebNets

– Spectral convolutions are defined as the multiplication of a signal (node features/attributes) by a kernel. – Thus similar to original convolution operation – The kernel used in a spectral convolution made of Chebyshev polynomials of the diagonal matrix of Laplacian eigenvalues – The kernel equals the sum of all Chebyshev polynomial kernels applied to the diagonal matrix of scaled Laplacian eigenvalues for each order of k up to K-1. – Using graph coarsening, it also introduced pooling methods similar to original convolution. – ChebNet implicitly avoids computing the eigendomposition opting to approximate it instead. – GCNs are basically first order ChebNets. – In GCNs, this is intended to alleviate the risk of overfitting on a local neighborhood of a graph. – GCNs performed well in node classification tasks and other graph applications, but the main drawback is how eigenvalues tend to cluster together in a very small range, with large gaps in between each cluster. – The problem of such GCNS was later solved by Cayleynets.