The difference between memory and prediction in linear recurrent networks
Not on the map. Why?
Abstract (arXiv)
Recurrent networks are trained to memorize their input better, often in the hopes that such training will increase the ability of the network to predict. We show that networks designed to memorize input can be arbitrarily bad at prediction. We also find, for several types of inputs, that one-node networks optimized for prediction are nearly at upper bounds on predictive capacity given by Wiener filters, and are roughly equivalent in performance to randomly generated five-node networks. Our results suggest that maximizing memory capacity leads to very different networks than maximizing predictive capacity, and that optimizing recurrent weights can decrease reservoir size by half an order of magnitude.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2021Exploiting Multiple Timescales in Hierarchical Echo State Networkscited by 11
- 2023Memory of recurrent networks: Do we compute it right?cited by 5
- 2025Memory Capacity of Nonlinear Recurrent Networks: Is it Informative?cited by 3
- 2021Interpretable Design of Reservoir Computing Networks using Realization Theorycited by 1
- 2024Separation capacity of linear reservoirs with random connectivity matrixcited by 1
- 2025Memory Capacity of Nonlinear Recurrent Networks: Is it Informative?7 Feb 2025
- 2024Separation capacity of linear reservoirs with random connectivity matrix26 Apr 2024
- 2023Memory of recurrent networks: Do we compute it right?2 May 2023
- 2021Interpretable Design of Reservoir Computing Networks using Realization Theory13 Dec 2021
- 2021Exploiting Multiple Timescales in Hierarchical Echo State Networks11 Jan 2021