Stochastic Reservoir Computers
Peter J. Ehlers, Hendra I. Nurdin, Daniel Soh

TL;DR
This paper establishes the universality of stochastic reservoir computers, demonstrating their theoretical capabilities and practical advantages, especially in noisy environments, for tasks like classification and time series prediction.
Contribution
It proves the universality of stochastic reservoir computing systems and compares their performance to deterministic systems under noise conditions.
Findings
Stochastic reservoir computers are universal approximators.
Performance improves over deterministic reservoirs when noise effects are minimal.
Shot noise limits performance but can be mitigated.
Abstract
Reservoir computing is a form of machine learning that utilizes nonlinear dynamical systems to perform complex tasks in a cost-effective manner when compared to typical neural networks. Many recent advancements in reservoir computing, in particular quantum reservoir computing, make use of reservoirs that are inherently stochastic. However, the theoretical justification for using these systems has not yet been well established. In this paper, we investigate the universality of stochastic reservoir computers, in which we use a stochastic system for reservoir computing using the probabilities of each reservoir state as the readout instead of the states themselves. In stochastic reservoir computing, the number of distinct states of the entire reservoir computer can potentially scale exponentially with the size of the reservoir hardware, offering the advantage of compact device size. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
