CoChat

Approximation rates for neural networks with general activation functions

Siegel, Jonathan W., Xu, Jinchao · 2020 · Neural Networks
Cited by 122

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.neunet.2020.05.019

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 3 references

Research works printed but not linked: 18

  1. Attali, 1997, Approximations of functions by a multilayer perceptron: a new approach, Neural Networks, 10, 1069, 10.1016/S0893-6080(97)00010-5 · DOI
  2. Barron, 1993, Universal approximation bounds for superpositions of a sigmoidal function, IEEE Transactions on Information Theory, 39, 930, 10.1109/18.256500 · DOI · Paper page
  3. Ellacott, 1994, Aspects of the numerical analysis of neural networks, Acta Numerica, 3, 145, 10.1017/S0962492900002439 · DOI
  4. Glorot, X., Bordes, A., & Bengio, Y. (2011). Deep sparse rectifier neural networks. In Proceedings of the fourteenth international conference on artificial intelligence and statistics (pp. 315–323).
  5. Hornik, 1993, Some new results on neural network approximation, Neural Networks, 6, 1069, 10.1016/S0893-6080(09)80018-X · DOI · Paper page
  6. Hornik, 1994, Degree of approximation results for feedforward networks approximating unknown mappings and their derivatives, Neural Computation, 6, 1262, 10.1162/neco.1994.6.6.1262 · DOI · Paper page
  7. Kainen, 2007, A Sobolev-type upper bound for rates of approximation by linear combinations of heaviside plane waves, Journal of Approximation Theory, 147, 1, 10.1016/j.jat.2006.12.009 · DOI
  8. Leshno, 1993, Multilayer feedforward networks with a nonpolynomial activation function can approximate any function, Neural Networks, 6, 861, 10.1016/S0893-6080(05)80131-5 · DOI · Paper page
  9. Maas, A. L., Hannun, A. Y., & Ng, A. Y. (2013). Rectifier nonlinearities improve neural network acoustic models. In Proc. Icml, Vol. 30 (pp. 3).
  10. Makovoz, 1996, Random approximants and neural networks, Journal of Approximation Theory, 85, 98, 10.1006/jath.1996.0031 · DOI
  11. Mhaskar, 1996, Neural networks for optimal approximation of smooth and analytic functions, Neural Computation, 8, 164, 10.1162/neco.1996.8.1.164 · DOI · Paper page
  12. Mhaskar, 1994, Dimension-independent bounds on the degree of approximation by neural networks, IBM Journal of Research and Development, 38, 277, 10.1147/rd.383.0277 · doi:10.1147/rd.383.0277
  13. Mhaskar, 1995, Degree of approximation by neural and translation networks with a single hidden layer, Advances in Applied Mathematics, 16, 151, 10.1006/aama.1995.1008 · doi:10.1006/aama.1995.1008
  14. Nair, V., & Hinton, G. E. (2010). Rectified linear units improve restricted boltzmann machines. In Proceedings of the 27th international conference on machine learning (ICML-10) (pp. 807–814).
  15. Petrushev, 1998, Approximation by ridge functions and neural networks, SIAM Journal on Mathematical Analysis, 30, 155, 10.1137/S0036141097322959 · doi:10.1137/s0036141097322959
  16. Pinkus, 1999, Approximation theory of the MLP model in neural networks, Acta Numerica, 8, 143, 10.1017/S0962492900002919 · DOI · Paper page
  17. Stone, 1948, The generalized weierstrass approximation theorem, Mathematics Magazine, 21, 237, 10.2307/3029337 · doi:10.2307/3029337
  18. Yarotsky, 2017, Error bounds for approximations with deep relu networks, Neural Networks, 94, 103, 10.1016/j.neunet.2017.07.002 · DOI · Paper page

Cited by

  • Training Compute-Optimal Large Language Models

    Hoffmann, J., Borgeaud, S., Mensch, A., Buchatskaya, E., Cai, T., Rutherford, E., Casas, D. D. L., Hendricks, L. A., Welbl, J., Clark, A., et al. (2022) · Advances in Neural Information Processing Systems 35 · doi:10.52202/068431-2176 · Cited by 932

    “On the set of two-layer neural networks , it is expected to be proportional to 1 𝑁 1 / 2 (Siegel and Xu, 2020).”

See all 122

Metadata

Authors
Siegel, J. W., & Xu, J.
Venue
Neural Networks
Publisher
Elsevier BV
Published
2020-08
Volume
128
Pages
313-321
ISSN
0893-6080
Cited by
122
References
3
Language
en
Licence
Funders
National Science Foundation

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 rates for neural networks with general activation functions. https://app.cochat.ai/papers/10.1016/j.neunet.2020.05.019
The paper
Siegel, J. W., & Xu, J. (2020). Approximation rates for neural networks with general activation functions. Neural Networks. https://doi.org/10.1016/j.neunet.2020.05.019

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.