Approximation by superpositions of a sigmoidal function |
| |
Authors: | G Cybenko |
| |
Affiliation: | (1) Center for Supercomputing Research and Development and Department of Electrical and Computer Engineering, University of Illinois, 61801 Urbana, Illinois, USA |
| |
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.
This research was supported in part by NSF Grant DCR-8619103, ONR Contract N000-86-G-0202 and DOE Grant DE-FG02-85ER25001. |
| |
Keywords: | Neural networks Approximation Completeness |
本文献已被 SpringerLink 等数据库收录! |
|