On the weight convergence of Elman networks.
An Elman network (EN) can be viewed as a feedforward (FF) neural network with an additional set of inputs from the context layer (feedback from the hidden layer). Therefore, instead of the offline backpropagation-through-time (BPTT) algorithm, a standard online (real-time) backpropagation (BP) algorithm, usually called Elman BP (EBP), can be applied for EN training for discrete-time sequence predictions. However, the standard BP training algorithm is not the most suitable for ENs. A low learning rate can improve the training of ENs but can also result in very slow convergence speeds and poor generalization performance, whereas a high learning rate can lead to unstable training in terms of weight divergence. Therefore, an optimal or suboptimal tradeoff between training speed and weight convergence with good generalization capability is desired for ENs. This paper develops a robust extended EBP (eEBP) training algorithm for ENs with a new adaptive dead zone scheme based on eEBP training concepts. The adaptive learning rate and adaptive dead zone optimize the training of ENs for each individual output and improve the generalization performance of the eEBP training. In particular, for the proposed eEBP training algorithm, convergence of the ENs' weights with the adaptive dead zone estimates is proven in the sense of Lyapunov functions. Computer simulations are carried out to demonstrate the improved performance of eEBP for discrete-time sequence predictions.
Song
Qing
Q
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore. eqsong@ntu.edu.sg
D000222:Adaptation, Physiological / Q000502:physiology; D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D005246:Feedback; D005793:Generalization, Psychological; D006801:Humans; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*; D011237:Predictive Value of Tests; D013997:Time Factors