Related Experiment Video
Updated: Nov 17, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
The Kolmogorov-Arnold representation theorem revisited
1University of Twente and Leiden University, Drienerlolaan 5, 7522 NB Enschede, The Netherlands.
Abstract:
There is a longstanding debate whether the Kolmogorov-Arnold representation theorem can explain the use of more than one hidden layer in neural networks. The Kolmogorov-Arnold representation decomposes a multivariate function into an interior and an outer function and therefore has indeed a similar structure as a neural network with two hidden layers. But there are distinctive differences. One of the main obstacles is that the outer function depends on the represented function and can be wildly varying even if the represented function is smooth. We derive modifications of the Kolmogorov-Arnold representation that transfer smoothness properties of the represented function to the outer function and can be well approximated by ReLU networks. It appears that instead of two hidden layers, a more natural interpretation of the Kolmogorov-Arnold representation is that of a deep neural network where most of the layers are required to approximate the interior function.
Related Concept Videos
Fundamental Theorem of Algebra
Parseval's Theorem
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which expresses a...
Reynolds Transport Theorem
Theorems of Pappus and Guldinus
For finding the surface area, consider a differential line element that generates a ring with surface area dA when revolved.
Castigliano's Theorem
Norton's Theorem

