Abstract
A collection of tasks is proposed for evaluating temporal neural network algorithms. Within this framework two procedures, a novel learning algorithm and an algorithm for generating temporal representations, are considered. The internal target generation learning algorithm for recurrent networks is designed for overcoming the problem of sparse targets in a temporal task. The temporal autoassociation representation of temporal sequences is designed to retain sequential order information in a recurrent network. On a simple benchmark it is shown to significantly improve convergence times over simple recurrent networks. Both the algorithm and the representation help bridge the gap between inputs and delayed targets that makes many temporal problems difficult. >
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.