Study on Speeding up the Back-Propagation Algorithm

TANG Ying; SUN Rongping; CHEN Kexing

Volume 4 Issue 4

Dec. 1997

Turn off MathJax

Article Contents

Article Navigation > International Journal of Minerals, Metallurgy and Materials > 1997 > 4(4): 52-54

TANG Ying, SUN Rongping, and CHEN Kexing, Study on Speeding up the Back-Propagation Algorithm, J. Univ. Sci. Technol. Beijing, 4(1997), No. 4, pp. 52-54.

Cite this article as:

TANG Ying, SUN Rongping, and CHEN Kexing, Study on Speeding up the Back-Propagation Algorithm, J. Univ. Sci. Technol. Beijing, 4(1997), No. 4, pp. 52-54.

TANG Ying, SUN Rongping, and CHEN Kexing, Study on Speeding up the Back-Propagation Algorithm, J. Univ. Sci. Technol. Beijing, 4(1997), No. 4, pp. 52-54.

Citation:

TANG Ying, SUN Rongping, and CHEN Kexing, Study on Speeding up the Back-Propagation Algorithm, J. Univ. Sci. Technol. Beijing, 4(1997), No. 4, pp. 52-54.

PDF( 258 KB)

Study on Speeding up the Back-Propagation Algorithm

+ Author Affiliations

Received: 22 March 1997

Abstract

Abstract

Slow convergence of back-propagation (BP) algorithm is a limiting factor in its practical applications. A new learning algorithm which can adaptively adjust its learning rate on the basis of gradient information of the error function is put forward. its convergence performance is also tested by the XOR problem compared with the standard BP algorithm.
- neural network;
- optimization;
- adaptation;
- learning rate