Abstract
Most of neural network applications rely on the fundamental approximation property of feed-forward networks. In a realistic problem setting, a mechanism is needed to devise a learning process for implementing this approximate mapping based on available data, starting from choosing an appropriate set of parameters in order to avoid overfitting, to an efficient learning algorithm measured by computation and memory complexities, as well as the accuracy of the training procedure, and not to forget testing and cross-validation for generalization. In the present paper we develop a comprehensive procedure to address the above issues in a systematic manner. This process is based on a common observation of Jacobian rank deficiency. A new numerical procedure for solving the nonlinear optimization problem in supervised learning is introduced which not only reduces the training time and overall complexity but also achieves good training accuracy and generalization.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |
Editors | Anon |
Publisher | IEEE |
Pages | 597-600 |
Number of pages | 4 |
Volume | 1 |
State | Published - 1997 |
Event | Proceedings of the 1997 IEEE International Symposium on Circuits and Systems, ISCAS'97. Part 4 (of 4) - Hong Kong, Hong Kong Duration: Jun 9 1997 → Jun 12 1997 |
Other
Other | Proceedings of the 1997 IEEE International Symposium on Circuits and Systems, ISCAS'97. Part 4 (of 4) |
---|---|
City | Hong Kong, Hong Kong |
Period | 6/9/97 → 6/12/97 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials