Gaussian Process Kolmogorov-Arnold Networks

Andrew Siyuan Chen
7/25/2024
cs.LGstat.ML

No official code found. Best implementation: sungjuGit/svgp-kan (0 stars, MIT, last commit 2026-04-19).

Abstract

In this paper, we introduce a probabilistic extension to Kolmogorov Arnold Networks (KANs) by incorporating Gaussian Process (GP) as non-linear neurons, which we refer to as GP-KAN. A fully analytical approach to handling the output distribution of one GP as an input to another GP is achieved by considering the function inner product of a GP function sample with the input distribution. These GP neurons exhibit robust non-linear modelling capabilities while using few parameters and can be easily and fully integrated in a feed-forward network structure. They provide inherent uncertainty estimates to the model prediction and can be trained directly on the log-likelihood objective function, without needing variational lower bounds or approximations. In the context of MNIST classification, a model based on GP-KAN of 80 thousand parameters achieved 98.5% prediction accuracy, compared to current state-of-the-art models with 1.5 million parameters.

View on arXivView PDF

Code Implementations(1)

sungjuGit/svgp-kanCommunity61%
MIT

SVGP-KAN: Sparse Variational Gaussian Process Kolmogorov-Arnold Networks

00PythonNov 28, 20256 months agoMIT

Similar Papers

Cite this paper

@article{chen2024gaussian,
  title  = {Gaussian Process Kolmogorov-Arnold Networks},
  author = {Andrew Siyuan Chen},
  year   = {2024},
  eprint = {2407.18397},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.18397v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.18397.svg)](https://codeofpaper.com/paper/2407.18397)

Discussion