Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels

By Simon Shaolei Du, Kangcheng Hou, Barnab'as P'oczos, Ruslan Salakhutdinov, Ruosong Wang, Keyulu Xu. Neural Information Processing Systems, 2019

311 citations recorded by the source corpus.

While graph kernels (GKs) are easy to train and enjoy provable theoretical guarantees, their practical performances are limited by their expressive power, as the kernel function often depends on hand-crafted combinatorial features of graphs. Compared to graph kernels, graph neural networks (GNNs) usually achieve better practical performance, as GNNs use multi-layer architectures and non-linear activation functions to extract high-order information of graphs as features. However, due to the large number of hyper-parameters and the non-convex nature of the training procedure, GNNs are harder to train. Theoretical guarantees of GNNs are also not well-understood. Furthermore, the expressive power of GNNs scales with the number of parameters, and thus it is hard to exploit the full power of GNNs when computing resources are limited. The current paper presents a new class of graph kernels, Graph Neural Tangent Kernels (GNTKs), which correspond to infinitely wide multi-layer GNNs trained by gradient descent. GNTKs enjoy the full expressive power of GNNs and inherit advantages of GKs. Theoretically, we show GNTKs provably learn a class of smooth functions on graphs. Empirically, we test GNTKs on graph classification datasets and show they achieve strong performance.

View Paper: https://www.semanticscholar.org/paper/f338528c156f275fcff3e310e157b23980e1bd19

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

  1. Greg Yang
  2. Yoshua Bengio
  3. Ruslan Salakhutdinov
  4. Sanjeev Arora
  5. Sergey Levine
  6. Lechao Xiao
  7. Quoc V. Le
  8. Jascha Narain Sohl-Dickstein

Citations in the corpus