Spectral-designed depthwise separable graph neural networks
Résumé
This paper aims at revisiting Convolutional Graph Neural Networks (ConvGNNs) by designing new graph convolutions in spectral domain with a custom frequency profile while applying them in the spatial domain. Within the proposed framework, we propose two ConvGNNs methods: one using a simple single-convolution kernel that operates as a low-pass filter, and one operating multiple convolution kernels called Depthwise Separable Graph Convolution Network (DSGCN). The latter is a generalization of the depthwise separable convolution framework for graph convolutional networks, which allows to decrease the total number of trainable parameters while keeping the capacity of the model unchanged. Our proposals are evaluated on both transductive and inductive graph learning problems, demonstrating that DSGCN outperforms the state-of-the-art methods.
Domaines
Machine Learning [stat.ML] Traitement du signal et de l'image [eess.SP] Statistiques [math.ST] Traitement du signal et de l'image [eess.SP] Réseau de neurones [cs.NE] Apprentissage [cs.LG] Ordinateur et société [cs.CY] Vision par ordinateur et reconnaissance de formes [cs.CV] Intelligence artificielle [cs.AI]Origine | Fichiers produits par l'(les) auteur(s) |
---|