The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Approximation by superposition of sigmoidal and radial basis functions
Open accessAbstract
Let @s: R -> R be such that for some polynomial P, @sP is bounded. We consider the linear span of the functions {@s(@l . (x - t)): @l, t @e R^s}. We prove that unless @s is itself a polynomial, it is possible to uniformly approximate any continuous function on R^s arbitrarily well on every compact subset of R^s by functions in this span. Under more specific conditions on @s, we give algorithms to achieve this approximation and obtain Jackson-type theorems to estimate the degree of approximation.
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
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
Rudin, W. (1973) · Cited by 13,740
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
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
Spline Functions: Basic Theory.
Smith, P. W., & Schumaker, L. (1982) · Mathematics of Computation · doi:10.2307/2007301 · Cited by 2,463
Proceedings of the International Joint Conference on Neural Networks, 2003.
(2003) · doi:10.1109/ijcnn.2003 · Cited by 1,674
Interpolation of Scattered Data: Distance Matrices and Conditionally Positive Definite Functions
Micchelli, C. A. (1984) · Approximation Theory and Spline Functions · doi:10.1007/978-94-009-6466-2_7 · Cited by 1,297
Self-citationInterpolation of scattered data: Distance matrices and conditionally positive definite functions
Micchelli, C. A. (1986) · Constructive Approximation · doi:10.1007/bf01893414 · Cited by 1,247
Self-citationRegularization Algorithms for Learning That Are Equivalent to Multilayer Networks
Poggio, T., & Girosi, F. (1990) · Science · doi:10.1126/science.247.4945.978 · Cited by 1,026
Cited by
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Approximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Chen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392253 · Cited by 1,230
Stochastic choice of basis functions in adaptive function approximation and the functional-link net
Igelnik, B., & Pao, Y.-H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.471375 · Cited by 955
Metadata
- Authors
- Mhaskar, H. N., & Micchelli, C. A.
- Venue
- Advances in Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1992-09
- Volume
- 13
- Issue
- 3
- Pages
- 350-373
- ISSN
- 0196-8858 (ISSN-L)
- OpenAlex
- W2051968241
- Cited by
- 257
- References
- 16
- FWCI
- 6.71
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Approximation by superposition of sigmoidal and radial basis functions. https://app.cochat.ai/papers/10.1016/0196-8858(92)90016-p
- The paper
- Mhaskar, H. N., & Micchelli, C. A. (1992). Approximation by superposition of sigmoidal and radial basis functions. Advances in Applied Mathematics. https://doi.org/10.1016/0196-8858(92)90016-p
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.