Skip to main content
Article
The General Approximation Theorem
Proceedings of the 1998 IEEE International Joint Conference on Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence
  • Donald C. Wunsch, Missouri University of Science and Technology
  • Alexander N. Gorban
Abstract

A general approximation theorem is proved. It uniformly envelopes both the classical Stone theorem and approximation of functions of several variables by means of superpositions and linear combinations of functions of one variable. This theorem is interpreted as a statement on universal approximating possibilities ("approximating omnipotence") of arbitrary nonlinearity. For the neural networks, our result states that the function of neuron activation must be nonlinear, and nothing else

Meeting Name
IEEE World Congress on Computational Intelligence (WCCI'98) (1998: May 4-9, Anchorage, AK)
Department(s)
Electrical and Computer Engineering
Keywords and Phrases
  • Stone Theorem,
  • Approximation Theory,
  • Function Approximation,
  • General Approximation Theorem,
  • Mathematics Computing,
  • Neural Nets,
  • Neural Networks,
  • Neuron Activation Function
International Standard Book Number (ISBN)
0000780348591
Document Type
Article - Conference proceedings
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1998 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
1-1-1998
Publication Date
01 Jan 1998
Citation Information
Donald C. Wunsch and Alexander N. Gorban. "The General Approximation Theorem" Proceedings of the 1998 IEEE International Joint Conference on Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence Vol. 2 (1998) p. 1271 - 1274 ISSN: 1098-7576
Available at: http://works.bepress.com/donald-wunsch/338/