The DOI matches its Crossref record.
Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives
Abstract
Recently Barron (1993) has given rates for hidden layer feedforward networks with sigmoid activation functions approximating a class of functions satisfying a certain smoothness condition. These rates do not depend on the dimension of the input space. We extend Barron's results to feedforward networks with possibly nonsigmoid activation functions approximating mappings and their derivatives simultaneously. Our conditions are similar but not identical to Barron's, but we obtain the same rates of approximation, showing that the approximation error decreases at rates as fast as n−1/2, where n is the number of hidden units. The dimension of the input space appears only in the constants of our bounds.
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
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
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
Risk bounds for model selection via penalization
Barron, A., Birgé, L., & Massart, P. (1999) · Probability Theory and Related Fields · doi:10.1007/s004400050210 · Cited by 657
Chapter 76 Large Sample Sieve Estimation of Semi-Nonparametric Models
Chen, X. (2007) · Handbook of Econometrics · doi:10.1016/s1573-4412(07)06076-x · Cited by 535
Metadata
- Authors
- Hornik, K., Stinchcombe, M., White, H., & Auer, P.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1994-11
- Volume
- 6
- Issue
- 6
- Pages
- 1262-1275
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2058538513
- Cited by
- 177
- References
- 0
- FWCI
- 6.62
- 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: Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives. https://app.cochat.ai/papers/10.1162/neco.1994.6.6.1262
- The paper
- Hornik, K., Stinchcombe, M., White, H., & Auer, P. (1994). Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives. Neural Computation. https://doi.org/10.1162/neco.1994.6.6.1262
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.