The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
The Kolmogorov–Arnold representation theorem revisited
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Visualizing and understanding convolutional networks
Zeiler, M. D., & Fergus, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10590-1_53 · Cited by 15,839
Rethinking ImageNet Pre-Training
He, K., Girshick, R., & Dollar, P. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00502 · Cited by 1,049
Kolmogorov's theorem and multilayer neural networks
Kůrková, V. (1992) · Neural Networks · doi:10.1016/0893-6080(92)90012-8 · Cited by 747
Why and when can deep-but not shallow-networks avoid the curse of dimensionality: A review
Poggio, T., Mhaskar, H., Rosasco, L., Miranda, B., & Liao, Q. (2017) · International Journal of Automation and Computing · doi:10.1007/s11633-017-1054-2 · Cited by 559
Kolmogorov, A. N. (1963) · American Mathematical Society Translations: Series 2 · doi:10.1090/trans2/028/04 · Cited by 454
A Theoretical Analysis of Deep Q-LearningPreprint
Fan, J., Wang, Z., Xie, Y., & Yang, Z. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.00137 · Cited by 445
A comparison of deep networks with ReLU activation function and linear spline-type methods
Eckle, K., & Schmidt-Hieber, J. (2019) · Neural Networks · doi:10.1016/j.neunet.2018.11.005 · Cited by 409
Self-citationAnalog computation via neural networks
Siegelmann, H. T., & Sontag, E. D. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90178-3 · Cited by 355
Metadata
- Authors
- Schmidt-Hieber, J.
- Venue
- Neural Networks
- Publisher
- Elsevier BV
- Published
- 2021-05
- Volume
- 137
- Pages
- 119-126
- ISSN
- 0893-6080
- OpenAlex
- W3127995079
- Cited by
- 282
- References
- 31
- FWCI
- 6.00
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Kolmogorov–Arnold representation theorem revisited. https://app.cochat.ai/papers/10.1016/j.neunet.2021.01.020
- The paper
- Schmidt-Hieber, J. (2021). The Kolmogorov–Arnold representation theorem revisited. Neural Networks. https://doi.org/10.1016/j.neunet.2021.01.020
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.