A constructive algorithm for uniformly approximating real continuous mappings by linear combinations of bounded sigmoidal functions is given. G. Cybenko (1989) has demonstrated the existence of uniform approximations to any continuous f provided that σ is continuous; the proof is nonconstructive, relying on the Hahn-Branch theorem and the dual characterization of C(In ). Cybenko's result is extended to include any bounded sigmoidal (even nonmeasurable ones). The approximating functions are explicitly constructed. The number of terms in the linear combination is minimal for first-order terms
Published in:
Proceedings of the IEEE
(Volume:78
,
Issue:
10
)
Date of Publication:
Oct 1990
- Page(s):
-
1586
-
1589
- ISSN :
-
0018-9219
- INSPEC Accession Number:
-
3796888
- Digital Object Identifier :
-
10.1109/5.58342
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Oct 1990
- Sponsored by :
-
IEEE