TL;DR
AdaGNN introduces an adaptive, trainable frequency response filter in graph neural networks, enhancing expressiveness and mitigating over-smoothing, validated through empirical results and theoretical analysis.
Contribution
The paper proposes AdaGNN with a novel adaptive filter that improves frequency component learning and reduces over-smoothing in GNNs.
Findings
Outperforms existing GNN models on benchmark datasets.
Effectively captures varying importance of frequency components.
Alleviates over-smoothing in deep GNN architectures.
Abstract
Graph Neural Networks have recently become a prevailing paradigm for various high-impact graph analytical problems. Existing efforts can be mainly categorized as spectral-based and spatial-based methods. The major challenge for the former is to find an appropriate graph filter to distill discriminative information from input signals for learning. Recently, myriads of explorations are made to achieve better graph filters, e.g., Graph Convolutional Network (GCN), which leverages Chebyshev polynomial truncation to seek an approximation of graph filters and bridge these two families of methods. Nevertheless, it has been shown in recent studies that GCN and its variants are essentially employing fixed low-pass filters to perform information denoising. Thus their learning capability is rather limited and may over-smooth node representations at deeper layers. To tackle these problems, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network · Graph Convolutional Network
