CoChat

Approximation by superpositions of a sigmoidal function

Open access
Cybenko, G. · 1989 · Mathematics of Control, Signals, and Systems

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

Abstract

In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set of affine functionals can uniformly approximate any continuous function ofn real variables with support in the unit hypercube; only mild conditions are imposed on the univariate function. Our results settle an open question about representability in the class of single hidden layer neural networks. In particular, we show that arbitrary decision regions can be arbitrarily well approximated by continuous feedforward neural networks with only a single internal, hidden layer and any continuous sigmoidal nonlinearity. The paper discusses approximation properties of other possible types of nonlinearities that might be implemented by artificial neural networks.

Overview

Integrity signals

Registry

Crossref · 10.1007/bf02551274

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

5 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Citations

Cites

Show all 24 references

Research works printed but not linked: 5

  1. [K] A. N. Kolmogorov, On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition,Dokl. Akad. Nauk. SSSR,114 (1957), 953–956.
  2. [MSJ] J. Makhoul, R. Schwartz, and A. El-Jaroudi, Classification capabilities of two-layer neural nets.Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Glasgow, 1989 (to appear).
  3. [MP] M. Minsky and S. Papert,Perceptrons, MIT Press, Cambridge, MA, 1969.
  4. [N] N. J. Nilsson,Learning Machines, McGraw-Hill, New York, 1965.
  5. [WL] A Wieland and R. Leighton, Geometric analysis of neural network capabilities,Proceedings of IEEE First International Conference on Neural Networks, San Diego, CA, pp. III-385–III-392, 1987.

Cited by

Items 601–700 of 1,050

Metadata

Authors
Cybenko, G.
Affiliations
University of Illinois Urbana-Champaign (US)
Corresponding author
Cybenko, G.
Venue
Mathematics of Control, Signals, and Systems
Published
1989-12
Volume
2
Issue
4
Pages
303-314
ISSN
  • 0932-4194 (ISSN-L)
  • 1435-568X
OpenAlex
W2103496339
Cited by
13,883
References
25
Citations by year
2026: 640 · 2025: 889 · 2024: 793 · 2023: 746 · 2022: 827 · 2021: 1050 · 2020: 1001 · 2019: 761 · 2018: 542 · 2017: 414 · 2016: 312 · 2015: 313 · 2014: 289 · 2013: 310 · 2012: 296
FWCI
94.52
Type
journal article
Language
en
Open access
Licence
  • cc-by-nc
  • www.springer.com/tdm (tdm)
Locations
  • Mathematics of Control Signals and Systems (publishedVersion)
  • HAL (submittedVersion, cc-by-nc)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
  • Physical Sciences › Mathematics › Applied Mathematics › Approximation Theory and Sequence Spaces
Keywords
universal approximation, sigmoidal function, single hidden layer neural network, feedforward neural networks, approximation of continuous functions, decision regions, nonlinear activation functions, unit hypercube

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

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.