TL;DR
The paper introduces AKGNN, a novel graph neural network that adaptively learns the optimal graph kernel to improve performance across diverse graph types, addressing limitations of fixed kernels.
Contribution
It proposes a data-driven mechanism to adaptively modulate graph kernels, enhancing GNN flexibility and performance across different graph structures.
Findings
AKGNN outperforms state-of-the-art GNNs on benchmark datasets.
The adaptive kernel learning improves representation quality.
Parameter reduction and global readout enhance model efficiency.
Abstract
Graph neural networks (GNNs) have demonstrated great success in representation learning for graph-structured data. The layer-wise graph convolution in GNNs is shown to be powerful at capturing graph topology. During this process, GNNs are usually guided by pre-defined kernels such as Laplacian matrix, adjacency matrix, or their variants. However, the adoptions of pre-defined kernels may restrain the generalities to different graphs: mismatch between graph and kernel would entail sub-optimal performance. For example, GNNs that focus on low-frequency information may not achieve satisfactory performance when high-frequency information is significant for the graphs, and vice versa. To solve this problem, in this paper, we propose a novel framework - i.e., namely Adaptive Kernel Graph Neural Network (AKGNN) - which learns to adapt to the optimal graph kernel in a unified manner at the first…
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
Taxonomy
MethodsGraph Neural Network · Convolution
