arXiv Machine Learning
Sep 1

Kolmogorov--Arnold against bounded translations

The paper revisits the Kolmogorov–Arnold representation theorem (KART), which has gained renewed interest through its use in neural networks such as Kolmogorov–Arnold Networks (KANs). It addresses the open question of KART’s stability when the hidden layer is subjected to continuous adversarial perturbations, specifically bounded translations. The authors present a constructive proof of an approximate representation that uses fixed, piecewise‑linear inner functions and a single outer function that remains invariant across all summands, provided the maximum translation bound is known in advance.

By Sviatoslav V. Dzhenzher
arXiv Machine Learning
Jun 26

Kolmogorov Arnold networks (KAN) for aerodynamic prediction: a comparison with MLPs and GNNs

arXiv:2606. 27126v1 Announce Type: new Abstract: Kolmogorov Arnold networks (KAN) have recently been introduced as a (deep) neural network architecture whose trainable parameters adapt the activation functions, instead of the coefficients of the affine transformations at the core of traditional architectures such as deep multilayer perceptrons (MLPs).

By Miguel Jaraiz, Fermin Gutierrez, Pablo Yeste, Miguel S\'anchez-Dom\'inguez, Eusebio Valero, Gonzalo Rubio, Lucas Lacasa