Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/180739
Title: | Infinite-dimensional reservoir computing | Authors: | Gonon, Lukas Grigoryeva, Lyudmila Ortega, Juan-Pablo |
Keywords: | Mathematical Sciences | Issue Date: | 2024 | Source: | Gonon, L., Grigoryeva, L. & Ortega, J. (2024). Infinite-dimensional reservoir computing. Neural Networks, 179, 106486-. https://dx.doi.org/10.1016/j.neunet.2024.106486 | Journal: | Neural Networks | Abstract: | Reservoir computing approximation and generalization bounds are proved for a new concept class of input/output systems that extends the so-called generalized Barron functionals to a dynamic context. This new class is characterized by the readouts with a certain integral representation built on infinite-dimensional state-space systems. It is shown that this class is very rich and possesses useful features and universal approximation properties. The reservoir architectures used for the approximation and estimation of elements in the new class are randomly generated echo state networks with either linear or ReLU activation functions. Their readouts are built using randomly generated neural networks in which only the output layer is trained (extreme learning machines or random feature neural networks). The results in the paper yield a recurrent neural network-based learning algorithm with provable convergence guarantees that do not suffer from the curse of dimensionality when learning input/output systems in the class of generalized Barron functionals and measuring the error in a mean-squared sense. | URI: | https://hdl.handle.net/10356/180739 | ISSN: | 0893-6080 | DOI: | 10.1016/j.neunet.2024.106486 | Schools: | School of Physical and Mathematical Sciences | Rights: | © 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | SPMS Journal Articles |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.