The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The Stone-Weierstrass theorem and its application to neural networks
Abstract
The Stone-Weierstrass theorem and its terminology are reviewed, and neural network architectures based on this theorem are presented. Specifically, exponential functions, polynomials, partial fractions, and Boolean functions are used to create networks capable of approximating arbitrary bounded measurable functions. A modified logistic network satisfying the theorem is proposed as an alternative to commonly used networks based on logistic squashing functions.
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
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
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
There exists a neural network that does not make avoidable mistakes
Gallant, & White (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23903 · Cited by 205
Cited by
Robust Adaptive Control of Feedback Linearizable MIMO Nonlinear Systems With Prescribed Performance
Bechlioulis, C. P., & Rovithakis, G. A. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929402 · Cited by 2,756
Approximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
High-order neural network structures for identification of dynamical systems
Kosmatopoulos, E. B., Polycarpou, M. M., Christodoulou, M. A., & Ioannou, P. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363477 · Cited by 802
Fuzzy min-max neural networks. I. Classification
Simpson, P. K. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.159066 · Cited by 782
Berg, J., & Nyström, K. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.06.056 · Cited by 657
Metadata
- Authors
- Cotter, N. E.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1990
- Volume
- 1
- Issue
- 4
- Pages
- 290-295
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2152619728
- Cited by
- 400
- References
- 9
- FWCI
- 6.73
- 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: The Stone-Weierstrass theorem and its application to neural networks. https://app.cochat.ai/papers/10.1109/72.80265
- The paper
- Cotter, N. E. (1990). The Stone-Weierstrass theorem and its application to neural networks. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.80265
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.