Abstract
The backpropagation (BP) algorithm is commonly used in many applications, including robotics, automation and weight changes of artificial neural networks (ANNs). This paper proposes the addition of an extra term, a proportional factor (PF), to the standard BP algorithm to speed up the weight adjusting process. The proposed algorithm is tested and the results show that the proposed algorithm outperforms the conventional BP algorithm in convergence speed and the ability to escape from learning stalls. The paper presents a convergence analysis of the three-term BP algorithm. It is shown that if the learning parameters of the three-term BP algorithm satisfies certain conditions given in this paper, then it is guaranteed that the system is stable and will converge to a local minimum. The paper shows that all the local minima of the cost function are stable for the three-term backpropagation algorithm.
| Original language | British English |
|---|---|
| Pages (from-to) | 3882-3887 |
| Number of pages | 6 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 4 |
| State | Published - 2002 |
| Event | 2002 IEEE International Conference on Robotics and Automation - Washington, DC, United States Duration: 11 May 2002 → 15 May 2002 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
Fingerprint
Dive into the research topics of 'A new three-term backpropagation algorithm with convergence analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver