The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Kolmogorov's Theorem Is Relevant
Abstract
We show that Kolmogorov's theorem on representations of continuous functions of n-variables by sums and superpositions of continuous functions of one variable is relevant in the context of neural networks. We give a version of this theorem with all of the one-variable functions approximated arbitrarily well by linear combinations of compositions of affine functions with some given sigmoidal function. We derive an upper estimate of the number of hidden units.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
On the approximate realization of continuous mappings by neural networks
Funahashi, K.-I. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90003-8 · Cited by 4,206 · cited 1×
“However, several recent results (Funahashi 1989; Hecht-Nielsen 1989; Hornik et al. 1989; Cybenko 1989; Carroll and Dickinson 1989; Stinchcornbe and White 1989, 1990; Hornik 1991) established that three layers are sufficient for approximations of general continuous functions.”
Result
Cited by
Neural networks for control systems—A survey
Hunt, K. J., Sbarbaro, D., Żbikowski, R., & Gawthrop, P. J. (1992) · Automatica · doi:10.1016/0005-1098(92)90053-i · Cited by 1,864
Approximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
Kolmogorov's theorem and multilayer neural networks
Kůrková, V. (1992) · Neural Networks · doi:10.1016/0893-6080(92)90012-8 · Cited by 747
Self-citationNoisy Time Series Prediction using Recurrent Neural Networks and Grammatical Inference
Giles, C. L., Lawrence, S., & Tsoi, A. C. (2001) · Machine Learning · doi:10.1023/a:1010884214864 · Cited by 374
The Kolmogorov–Arnold representation theorem revisited
Schmidt-Hieber, J. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.01.020 · Cited by 282
Metadata
- Authors
- Kůrková, V.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1991-12
- Volume
- 3
- Issue
- 4
- Pages
- 617-622
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2126685080
- Cited by
- 202
- References
- 3
- FWCI
- 4.60
- Type
- journal article
- Language
- en
- Open access
- closed
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: Kolmogorov's Theorem Is Relevant. https://app.cochat.ai/papers/10.1162/neco.1991.3.4.617
- The paper
- Kůrková, V. (1991). Kolmogorov's Theorem Is Relevant. Neural Computation. https://doi.org/10.1162/neco.1991.3.4.617
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.