Cited by 2,121Neural Networks and ApplicationsMachine Learning and ELMApproximation Theory and Sequence Spaces

Multilayer feedforward networks with a nonpolynomial activation function can approximate any function

Open access
Leshno, Moshe, Lin, Vladimir Ya., Pinkus, Allan, Schocken, Shimon·1993·Neural Networks

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.

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

Integrity signals

Registry

Crossref · 10.1016/s0893-6080(05)80131-5

Cites

Statistics

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.

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?

  • Feedforward neural networks with enough free parameters can approximate any continuous function on a closed and bounded subset of R^n to arbitrary accuracy.

    “These theorems guarantee that, provided enough free parameters, feedforward neural networks can approximate any continuous function on a closed and bounded subset of R n to an arbitrary degree of accuracy.”

    From Continuous-variable quantum neural networks (2019) · cites this paper as [56]

    The Background and Results sections support arbitrary-accuracy approximation of continuous functions on compact subsets of R^n. But the paper makes this conditional on a nonpolynomial activation function and emphasizes that the theorem fails without a threshold; having enough free parameters alone is not sufficient. Page numbers are not supplied in our copy. (LLM, conf=0.87)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

No references could be resolved yet.

Research works printed but not linked: 6

  1. Adams, R.A. (1975). Sobolov Spaces. New York: Academic Press.
  2. Bachman, G. and Narici, L. (1972). Functional Analysis. Academic Press, fifth edition.
  3. Gallant, A.R. and White, H. (1988). There exists a neural network that does not make avoidable mistakes. In IEEE Second Int. Conf. on Neural Networks (pp. 13657-664) Sun Diego: SOS Printing. Center for Digital Economy Research Stern School of Business Worhng Paper IS-92-13
  4. Hecht-Nielsen, R. (1989). Theory of the backpropagation neural network. In Proc. of the Int. Joint Conf. on Neural Networks, Sun Diego: SOS Printing, pages I:593-606.
  5. Irie, B. and Miyake, S. (1988). Capabilities of three layer perceptrons. In IEEE Second Int. Conf. on Neural Networks (pp. I:641-648) San Diego: SOS Printing.
  6. LeCun, Y. (1987). Models Connexionistes de l'apprentissage. Master's thesis, Universite Pierre et Marie Curie. Lin, V.Ya. and Pinkus, A. (preprint ). Fundamentality of ridge functions. Stinchcornbe, M. and White, H. (1990). Approximating and learning unknown mappings using multilayer feedforwad networks with bounded weights. Technical Report, San Diego: Dept. of Economics, University of California. Preprint. Center for Digital Economy Research Stem School of Business %'orking Paper IS-92-13

Cited by

Sorted by citations

Authors
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S.
Affiliations
  • Hebrew University of Jerusalem (IL)
  • Technion – Israel Institute of Technology (IL)
  • New York University (US)
Corresponding author
Leshno, Moshe
Venue
Neural Networks
Publisher
Elsevier BV
Published
1993-01
Volume
6
Issue
6
Pages
861-867
ISSN
0893-6080 (ISSN-L)
OpenAlex
W2043005456
Cited by
2,121
References
0
Citations by year
2026: 98 · 2025: 129 · 2024: 148 · 2023: 177 · 2022: 191 · 2021: 239 · 2020: 213 · 2019: 115 · 2018: 82 · 2017: 45 · 2016: 44 · 2015: 43 · 2014: 39 · 2013: 33 · 2012: 27
FWCI
28.06
Type
journal article
Language
en
Open access
Locations
  • Neural Networks (publishedVersion)
  • Faculty Digital Archive (New York University Florence) (submittedVersion)
  • SSRN Electronic Journal (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
  • Physical Sciences › Mathematics › Statistics and Probability › Approximation Theory and Sequence Spaces
Keywords
multilayer perceptron, universal approximation, approximation of continuous functions, threshold functions, approximation theorems

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