Approximation by superpositions of a sigmoidal function - Archive ouverte HAL
Journal Articles Mathematics of Control, Signals, and Systems Year : 1989

Approximation by superpositions of a sigmoidal function

Abstract

In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set ofaffine functionals can uniformly approximate any continuous function of n 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 bidden 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.
Fichier principal
Vignette du fichier
Cybenko1989.pdf (281.81 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03753170 , version 1 (17-08-2022)

Licence

Identifiers

Cite

G. Cybenko. Approximation by superpositions of a sigmoidal function. Mathematics of Control, Signals, and Systems, 1989, 2 (4), pp.303-314. ⟨10.1007/BF02551274⟩. ⟨hal-03753170⟩
528 View
5757 Download

Altmetric

Share

More