TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/Bridging the Gap Between Spectral and Spatial Domains in G...

Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks

Muhammet Balcilar, Guillaume Renton, Pierre Heroux, Benoit Gauzere, Sebastien Adam, Paul Honeine

2020-03-26Graph ClassificationGraph LearningNode Classification
PaperPDFCode(official)Code

Abstract

This paper aims at revisiting Graph Convolutional Neural Networks by bridging the gap between spectral and spatial design of graph convolutions. We theoretically demonstrate some equivalence of the graph convolution process regardless it is designed in the spatial or the spectral domain. The obtained general framework allows to lead a spectral analysis of the most popular ConvGNNs, explaining their performance and showing their limits. Moreover, the proposed framework is used to design new convolutions in spectral domain with a custom frequency profile while applying them in the spatial domain. We also propose a generalization of the depthwise separable convolution framework for graph convolutional networks, what allows to decrease the total number of trainable parameters by keeping the capacity of the model. To the best of our knowledge, such a framework has never been used in the GNNs literature. Our proposals are evaluated on both transductive and inductive graph learning problems. Obtained results show the relevance of the proposed method and provide one of the first experimental evidence of transferability of spectral filter coefficients from one graph to another. Our source codes are publicly available at: https://github.com/balcilar/Spectral-Designed-Graph-Convolutions

Results

TaskDatasetMetricValueModel
Graph ClassificationENZYMESAccuracy78.39DSGCN-allfeat
Graph ClassificationENZYMESAccuracy65.13DSGCN-nodelabel
Node ClassificationCora: fixed 20 node per classAccuracy84.2DSGCN
Node ClassificationCiteSeer with Public Split: fixed 20 nodes per classAccuracy73.3DSGCN
ClassificationENZYMESAccuracy78.39DSGCN-allfeat
ClassificationENZYMESAccuracy65.13DSGCN-nodelabel

Related Papers

SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation2025-07-17A Graph-in-Graph Learning Framework for Drug-Target Interaction Prediction2025-07-15Graph World Model2025-07-14Federated Learning with Graph-Based Aggregation for Traffic Forecasting2025-07-13Graph Learning2025-07-08GDGB: A Benchmark for Generative Dynamic Text-Attributed Graph Learning2025-07-04S2FGL: Spatial Spectral Federated Graph Learning2025-07-03Interpretable Hierarchical Concept Reasoning through Attention-Guided Graph Learning2025-06-26