Abstract
Three improvements to gradient-based training algorithms are proposed, accelerating convergence of the conventional methods by up to two orders of magnitude. Premature saturation of hidden nodes is circumvented; weights leading to linear output nodes are updated non-recuxsively; and training of feedback structures is facilitated by two preliminary feedforward-training phases prior to the final feedback training. Performance evaluation on two simulated processes demonstrates the effect of complex search spaces on the conventional, and the new, algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.