Clenshaw Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph Convolutional Networks (GCNs), which use a message-passing paradigm with stacked convolution layers, are foundational methods for learning graph representations. Recent GCN models use various residual connection techniques to alleviate the model degradation problem such as over-smoothing and gradient vanishing. Existing residual connection techniques, however, fail to make extensive use of underlying graph structure as in the graph spectral domain, which is critical for obtaining satisfactory results on heterophilic graphs. In this paper, we introduce ClenshawGCN, a GNN model that employs the Clenshaw Summation Algorithm to enhance the expressiveness of the GCN model. ClenshawGCN equips the standard GCN model with two straightforward residual modules: the adaptive initial residual connection and the negative second-order residual connection. We show that by adding these two residual modules, ClenshawGCN implicitly simulates a polynomial filter under the Chebyshev basis, giving it at least as much expressive power as polynomial spectral GNNs. In addition, we conduct comprehensive experiments to demonstrate the superiority of our model over spatial and spectral GNN models.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 39 of its 64 references that are in the map. First posted on arXiv 29 Oct 2022.
Builds on
39 of 64 references.
References · 39
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2021E(n) Equivariant Graph Neural Networkscited by 951
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
27 more
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
- 2019Graph Neural Networks for Social Recommendationcited by 711
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2019Diffusion Improves Graph Learningcited by 414
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
- 2019Graph Neural Networks with convolutional ARMA filterscited by 185
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Graph Neural Networks for Graphs with Heterophily: A Surveycited by 175
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2020Interpreting Graph Neural Networks for NLP With Differentiable Edge Maskingcited by 152
- 2021Interpreting and Unifying Graph Neural Networks with An Optimization Frameworkcited by 131
- 2022Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisitedcited by 87
- 2021Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?cited by 82
- 2022Graph Attention Multi-Layer Perceptroncited by 82
- 2019Improving Graph Attention Networks with Large Margin-based Constraintscited by 34
- 2022Model Degradation Hinders Deep Graph Neural Networkscited by 26
- 2013Vertex-Frequency Analysis on Graphscited by 24
Built on by
Citing papers per year: 2024: 4; 2025: 0; 2026: 1.
5 papers.
- 2024A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directionscited by 13
- 2024A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectivenesscited by 6
- 2024Rethinking Spectral Graph Neural Networks with Spatially Adaptive Filteringcited by 3
- 2024Polynomial Selection in Spectral Graph Neural Networks: An Error-Sum of Function Slices Approachcited by 1
- 2026Spectral Graph Neural Networks with Hermite Polynomials: A Comprehensive Studycited by 0
- 2026Spectral Graph Neural Networks with Hermite Polynomials: A Comprehensive Study24 Sep 2026
- 2024A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness14 Jun 2024
- 2024Polynomial Selection in Spectral Graph Neural Networks: An Error-Sum of Function Slices Approach15 Apr 2024
- 2024A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions18 Jan 2024
- 2024Rethinking Spectral Graph Neural Networks with Spatially Adaptive Filtering17 Jan 2024