Skip to main content
Conference ProceedingsOPEN ACCESS

Interval methods for seeking fixed points of recurrent neural networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12139 LNCS 414-423
DOI: 10.1007/978-3-030-50420-5_30
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper describes an application of interval methods to train recurrent neural networks and investigate their behavior. The HIBA_USNE multithreaded interval solver for nonlinear systems and algorithmic differentiation using ADHC are used. Using interval methods, we can not only train the network, but precisely localize all stationary points of the network. Preliminary numerical results for continuous Hopfield-like networks are presented.

Author supplied keywords

Cite

CITATION STYLE

APA

Kubica, B. J., Hoser, P., & Wiliński, A. (2020). Interval methods for seeking fixed points of recurrent neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12139 LNCS, pp. 414–423). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-50420-5_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free