Necessary and sufficient conditions for universality of Kolmogorov-Arnold networks
Vugar Ismailov

TL;DR
This paper establishes the necessary and sufficient conditions for the universality of Kolmogorov-Arnold Networks (KANs), showing that a single non-affine edge function suffices for universal approximation.
Contribution
It provides a complete characterization of when KANs are universal, including the minimal set of edge functions needed and the universality of spline-based KANs.
Findings
A single non-affine edge function ensures universality in deep KANs.
Two hidden layers require the edge function to be nonpolynomial for universality.
A finite set of affine functions combined with a non-affine function suffices for universality.
Abstract
We analyze the universal approximation property of Kolmogorov-Arnold Networks (KANs) in terms of their edge functions. If these functions are all affine, then universality clearly fails. How many non-affine functions are needed, in addition to affine ones, to ensure universality? We show that a single one suffices. More precisely, we prove that deep KANs in which all edge functions are either affine or equal to a fixed continuous function are dense in for every compact set if and only if is non-affine. In contrast, for KANs with exactly two hidden layers, universality holds if and only if is nonpolynomial. We further show that the full class of affine functions is not required; it can be replaced by a finite set without affecting universality. In particular, in the nonpolynomial case, a fixed family of five affine functions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
