Variational Kolmogorov-Arnold Network

Francesco Alesiani, Henrik Christiansen, Federico Errica
7/3/2025
cs.LG

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Kolmogorov Arnold Networks (KANs) are an emerging architecture for building machine learning models. KANs are based on the theoretical foundation of the Kolmogorov-Arnold Theorem and its expansions, which provide an exact representation of a multi-variate continuous bounded function as the composition of a limited number of univariate continuous functions. While such theoretical results are powerful, their use as a representation learning alternative to a multi-layer perceptron (MLP) hinges on the ad-hoc choice of the number of bases modeling each of the univariate functions. In this work, we show how to address this problem by adaptively learning a potentially infinite number of bases for each univariate function during training. We therefore model the problem as a variational inference optimization problem. Our proposal, called InfinityKAN, which uses backpropagation, extends the potential applicability of KANs by treating an important hyperparameter as part of the learning process.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{alesiani2025variational,
  title  = {Variational Kolmogorov-Arnold Network},
  author = {Francesco Alesiani and Henrik Christiansen and Federico Errica},
  year   = {2025},
  eprint = {2507.02466},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.02466v1}
}

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/2507.02466.svg)](https://codeofpaper.com/paper/2507.02466)

Discussion