Abstract
Insight into the core of the pipelined recurrent neural network (PRNN) in prediction applications is provided. It is shown that modules of the PRNN contribute to the final predicted value at the output of the PRNN in two ways, namely through the process of nesting, and through the process of learning. A measure of the influence of the output of a distant module to the amplitude at the output of the PRNN is analytically found, and the upper bound for it is derived. Furthermore, an analysis of the influence of the forgetting factor in the cost function of the PRNN to the process of learning is undertaken, and it is found that for the PRNN, the forgetting factor can even exceed unity in order to obtain the best predictor. Simulations on three speech signals support that approach, and outperform the other stochastic gradient based schemes. (6 pages)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
