Kolmogorov Arnold stability holds for discontinuous deep learning functions

Kolmogorov--Arnold stability for discontinuous functions

Machine Learning

Summary

The paper studies how a mathematical way to represent complex functions, called the Kolmogorov–Arnold theorem, stays reliable even when the function is jumpy or unsteady. The authors explore how this stability works when deep learning networks face tricky changes that try to confuse or break them. Their findings support why certain deep neural networks remain robust when their inner layers are reconfigured in adversarial ways. This helps explain why these networks can perform well even under challenging conditions.

What this means in practice

A theory result. No direct application yet.

Authors

Sviatoslav V. Dzhenzher

Abstract

Here we investigate the stability of the Kolmogorov--Arnold representation theorem (KART) under adversarial reparameterisations of the hidden layer for multivariate discontinuous and unbounded functions. Our results provide a rigorous mathematical foundation for the structural robustness of modern deep learning architectures, such as Kolmogorov--Arnold Networks (KANs), under adversarial configurations.