z-logo
open-access-imgOpen Access
Approximation by superpositions of a sigmoidal function
Author(s) -
George Cybenko
Publication year - 1989
Publication title -
mathematics of control signals and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.856
H-Index - 39
eISSN - 1435-568X
pISSN - 0932-4194
DOI - 10.1007/bf02551274
Subject(s) - sigmoid function , univariate , artificial neural network , hypercube , feedforward neural network , nonlinear system , affine transformation , class (philosophy) , set (abstract data type) , function (biology) , mathematics , computer science , feed forward , function approximation , algorithm , topology (electrical circuits) , discrete mathematics , artificial intelligence , pure mathematics , multivariate statistics , combinatorics , statistics , physics , evolutionary biology , biology , quantum mechanics , control engineering , engineering , programming language
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom