Abstract
Conditions of configuring feedforward neural networks without local minima are analyzed for both synchronous and asynchronous learning rules. Based on the analysis, a learning algorithm that integrates a synchronous-asynchronous learning rule with a dynamic configuration rule to train feedforward neural networks is presented. The theoretic analysis and numerical simulation reveal that the proposed learning algorithm substantially reduces the likelihood of local minimum solutions in supervised learning.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE International Conference on Systems Engineering 1991 |
| Publisher | IEEE |
| Pages | 185-188 |
| ISBN (Print) | 780301730 |
| DOIs | |
| Publication status | Published - Aug 1991 |
| Externally published | Yes |
| Event | IEEE International Conference on Systems Engineering 1991 - Dayton, United States Duration: 1 Aug 1991 → 3 Aug 1991 |
Conference
| Conference | IEEE International Conference on Systems Engineering 1991 |
|---|---|
| Place | United States |
| City | Dayton |
| Period | 1/08/91 → 3/08/91 |