Determination of the edge of criticality in echo state networks through Fisher information maximization
Lorenzo Livi, Filippo Maria Bianchi, Cesare Alippi

TL;DR
This paper introduces an unsupervised, Fisher information-based method to identify the edge of criticality in echo state networks, optimizing their computational capabilities without relying on application-specific tuning.
Contribution
It proposes a theoretically grounded, non-parametric Fisher information estimator to determine the critical operating region of echo state networks, independent of input signals.
Findings
Fisher information peaks at the critical edge of the network.
The method accurately identifies the critical region across benchmarks.
Experimental results show improved network performance at identified critical points.
Abstract
It is a widely accepted fact that the computational capability of recurrent neural networks is maximized on the so-called "edge of criticality". Once the network operates in this configuration, it performs efficiently on a specific application both in terms of (i) low prediction error and (ii) high short-term memory capacity. Since the behavior of recurrent networks is strongly influenced by the particular input signal driving the dynamics, a universal, application-independent method for determining the edge of criticality is still missing. In this paper, we aim at addressing this issue by proposing a theoretically motivated, unsupervised method based on Fisher information for determining the edge of criticality in recurrent neural networks. It is proven that Fisher information is maximized for (finite-size) systems operating in such critical regions. However, Fisher information is…
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.
