Mathematics of Control, Signals and Systems

, Volume 2, Issue 4, pp 303-314

First online:

Approximation by superpositions of a sigmoidal function

  • G. CybenkoAffiliated withCenter for Supercomputing Research and Development and Department of Electrical and Computer Engineering, University of Illinois

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Key words

Neural networks Approximation Completeness