Reservoirs learn to learn
Not on the map. Why?
Abstract (arXiv)
We consider reservoirs in the form of liquid state machines, i.e., recurrently connected networks of spiking neurons with randomly chosen weights. So far only the weights of a linear readout were adapted for a specific task. We wondered whether the performance of liquid state machines can be improved if the recurrent weights are chosen with a purpose, rather than randomly. After all, weights of recurrent connections in the brain are also not assumed to be randomly chosen. Rather, these weights were probably optimized during evolution, development, and prior learning experiences for specific task domains. In order to examine the benefits of choosing recurrent weights within a liquid with a purpose, we applied the Learning-to-Learn (L2L) paradigm to our model: We optimized the weights of the recurrent connections -- and hence the dynamics of the liquid state machine -- for a large family of potential learning tasks, which the network might have to learn later through modification of the weights of readout neurons. We found that this two-tiered process substantially improves the learning speed of liquid state machines for specific tasks. In fact, this learning speed increases further if one does not train the weights of linear readouts at all, and relies instead on the internal dynamics and fading memory of the network for remembering salient information that it could extract from preceding examples for the current learning task. This second type of learning has recently been proposed to underlie fast learning in the prefrontal cortex and motor cortex, and hence it is of interest to explore its performance also in models. Since liquid state machines share many properties with other types of reservoirs, our results raise the question whether L2L conveys similar benefits also to these other reservoirs.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1.
4 papers.
- 2023A Survey on Reservoir Computing and its Interdisciplinary Applications Beyond Traditional Machine Learningcited by 22
- 2023Memristive Reservoirs Learn to Learncited by 4
- 2024Reservoir Computing for Fast, Simplified Reinforcement Learning on Memory Taskscited by 3
- 2025Meta-Learning to Explore via Memory Density Feedbackcited by 0
- 2025Meta-Learning to Explore via Memory Density Feedback4 Mar 2025
- 2024Reservoir Computing for Fast, Simplified Reinforcement Learning on Memory Tasks17 Dec 2024
- 2023A Survey on Reservoir Computing and its Interdisciplinary Applications Beyond Traditional Machine Learning27 Jul 2023
- 2023Memristive Reservoirs Learn to Learn22 Jun 2023