Representation Properties of Networks: Kolmogorov's Theorem Is Irrelevant
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Many neural networks can be regarded as attempting to approximate a multivariate function in terms of one-input one-output units. This note considers the problem of an exact representation of nonlinear mappings in terms of simpler functions of fewer variables. We review Kolmogorov's theorem on the representation of functions of several variables in terms of functions of one variable and show that it is irrelevant in the context of networks for learning.
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×
“This argument is discussed in some length in Poggio and Girosi (19891, and a number of results have been recently obtained by some authors (Hornik et al. 1989; Stinchcombe and White 1989; Carroll and Dickinson 1989; Cybenko 1989; Funahashi 1989; Hecht-Nielsen 1989).”
Result
Cited by
Networks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Self-citationNeural 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
Multilayer perceptrons for classification and regression
Murtagh, F. (1991) · Neurocomputing · doi:10.1016/0925-2312(91)90023-5 · Cited by 1,014
Elements of Artificial Neural Networks
Mehrotra, K., Mohan, C., & Ranka, S. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/2687.001.0001 · Cited by 912
Metadata
- Authors
- Girosi, F., & Poggio, T.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1989-12
- Volume
- 1
- Issue
- 4
- Pages
- 465-469
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2108671543
- Cited by
- 194
- References
- 3
- FWCI
- 3.74
- 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
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.