Insight into Delay Based Reservoir Computing via Eigenvalue Analysis
- URL: http://arxiv.org/abs/2009.07928v3
- Date: Mon, 22 Mar 2021 20:25:02 GMT
- Title: Insight into Delay Based Reservoir Computing via Eigenvalue Analysis
- Authors: Felix K\"oster, Serhiy Yanchuk, Kathy L\"udge
- Abstract summary: We show that any dynamical system used as a reservoir can be analyzed in this way.
Optimal performance is found for a system with the eigenvalues having real parts close to zero and off-resonant imaginary parts.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper we give a profound insight into the computation capability of
delay-based reservoir computing via an eigenvalue analysis. We concentrate on
the task-independent memory capacity to quantify the reservoir performance and
compare these with the eigenvalue spectrum of the dynamical system. We show
that these two quantities are deeply connected, and thus the reservoir
computing performance is predictable by analyzing the small signal response of
the reservoir. Our results suggest that any dynamical system used as a
reservoir can be analyzed in this way. We apply our method exemplarily to a
photonic laser system with feedback and compare the numerically computed recall
capabilities with the eigenvalue spectrum. Optimal performance is found for a
system with the eigenvalues having real parts close to zero and off-resonant
imaginary parts.
Related papers
- Fast Shapley Value Estimation: A Unified Approach [71.92014859992263]
We propose a straightforward and efficient Shapley estimator, SimSHAP, by eliminating redundant techniques.
In our analysis of existing approaches, we observe that estimators can be unified as a linear transformation of randomly summed values from feature subsets.
Our experiments validate the effectiveness of our SimSHAP, which significantly accelerates the computation of accurate Shapley values.
arXiv Detail & Related papers (2023-11-02T06:09:24Z) - Optimization of a Hydrodynamic Computational Reservoir through Evolution [58.720142291102135]
We interface with a model of a hydrodynamic system, under development by a startup, as a computational reservoir.
We optimized the readout times and how inputs are mapped to the wave amplitude or frequency using an evolutionary search algorithm.
Applying evolutionary methods to this reservoir system substantially improved separability on an XNOR task, in comparison to implementations with hand-selected parameters.
arXiv Detail & Related papers (2023-04-20T19:15:02Z) - Reservoir Computing Using Complex Systems [0.0]
Reservoir Computing is a machine learning framework for utilising physical systems for computation.
We show how a single node reservoir can be employed for computation and explore the available options to improve the computational capability of the physical reservoirs.
arXiv Detail & Related papers (2022-12-17T00:25:56Z) - Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces.
We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
arXiv Detail & Related papers (2022-04-20T21:15:38Z) - Optimal reservoir computers for forecasting systems of nonlinear
dynamics [0.0]
We show that reservoirs of low connectivity perform better than or as well as those of high connectivity in forecasting noiseless Lorenz and coupled Wilson-Cowan systems.
We also show that, unexpectedly, computationally effective reservoirs of unconnected nodes (RUN) outperform reservoirs of linked network topologies in predicting these systems.
arXiv Detail & Related papers (2022-02-09T09:36:31Z) - Eigen Analysis of Self-Attention and its Reconstruction from Partial
Computation [58.80806716024701]
We study the global structure of attention scores computed using dot-product based self-attention.
We find that most of the variation among attention scores lie in a low-dimensional eigenspace.
We propose to compute scores only for a partial subset of token pairs, and use them to estimate scores for the remaining pairs.
arXiv Detail & Related papers (2021-06-16T14:38:42Z) - Learning Optical Flow from a Few Matches [67.83633948984954]
We show that the dense correlation volume representation is redundant and accurate flow estimation can be achieved with only a fraction of elements in it.
Experiments show that our method can reduce computational cost and memory use significantly, while maintaining high accuracy.
arXiv Detail & Related papers (2021-04-05T21:44:00Z) - Limitations of the recall capabilities in delay based reservoir
computing systems [0.0]
We analyze the memory capacity of a delay based reservoir computer with a Hopf normal form as nonlinearity.
A possible physical realisation could be a laser with external cavity, for which the information is fed via electrical injection.
arXiv Detail & Related papers (2020-09-16T13:54:39Z) - The Computational Capacity of LRC, Memristive and Hybrid Reservoirs [1.657441317977376]
Reservoir computing is a machine learning paradigm that uses a high-dimensional dynamical system, or emphreservoir, to approximate and predict time series data.
We analyze the feasibility and optimal design of electronic reservoirs that include both linear elements (resistors, inductors, and capacitors) and nonlinear memory elements called memristors.
Our electronic reservoirs can match or exceed the performance of conventional "echo state network" reservoirs in a form that may be directly implemented in hardware.
arXiv Detail & Related papers (2020-08-31T21:24:45Z) - Spatially Adaptive Inference with Stochastic Feature Sampling and
Interpolation [72.40827239394565]
We propose to compute features only at sparsely sampled locations.
We then densely reconstruct the feature map with an efficient procedure.
The presented network is experimentally shown to save substantial computation while maintaining accuracy over a variety of computer vision tasks.
arXiv Detail & Related papers (2020-03-19T15:36:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.