%0 Journal Article %1 citeulike:3561150 %A Cybenko, G. %D 1989 %I Springer London %J Mathematics of Control, Signals, and Systems (MCSS) %K approximation, control, duckling, free, lunch, no, theorem, theory, ugly, universal %N 4 %P 303--314 %R 10.1007/BF02551274 %T Approximation by superpositions of a sigmoidal function %U http://dx.doi.org/10.1007/BF02551274 %V 2 %X 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 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 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.

@article{citeulike:3561150, 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 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 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.}}, added-at = {2012-03-02T03:39:18.000+0100}, author = {Cybenko, G.}, biburl = {https://www.bibsonomy.org/bibtex/2be85c56ae384216b2e35bdf79b7fb477/baby9992006}, citeulike-article-id = {3561150}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF02551274}, citeulike-linkout-1 = {http://www.springerlink.com/content/n873j15736072427}, day = 1, doi = {10.1007/BF02551274}, interhash = {96aecb02daa11041489259a8edb54070}, intrahash = {be85c56ae384216b2e35bdf79b7fb477}, issn = {0932-4194}, journal = {Mathematics of Control, Signals, and Systems (MCSS)}, keywords = {approximation, control, duckling, free, lunch, no, theorem, theory, ugly, universal}, month = dec, number = 4, pages = {303--314}, posted-at = {2012-02-28 13:17:08}, priority = {2}, publisher = {Springer London}, timestamp = {2012-03-02T03:39:20.000+0100}, title = {{Approximation by superpositions of a sigmoidal function}}, url = {http://dx.doi.org/10.1007/BF02551274}, volume = 2, year = 1989 }