Search arXivSearch

arXiv · 2211.00161

Complex topological features of reservoirs shape learning performances in bio-inspired recurrent neural networks

Abstract

Recurrent networks are a special class of artificial neural systems that use their internal states to perform computing tasks for machine learning. One of its state-of-the-art developments, i.e. reservoir computing (RC), uses the internal structure -- usually a static network with random structure -- to map an input signal into a nonlinear dynamical system defined in a higher dimensional space. Reservoirs are characterized by nonlinear interactions among their units and their ability to store information through recurrent loops, allowing to train artificial systems to learn task-specific dynamics. However, it is fundamentally unknown how the random topology of the reservoir affects the learning performance. Here, we fill this gap by considering a battery of synthetic networks -- characterized by different topological features -- and 45 empirical connectomes -- sampled from brain regions of organisms belonging to 8 different species -- to build the reservoir and testing the learning performance against a prediction task with a variety of complex input signals. We find nontrivial correlations between RC performances and both the number of nodes and rank of the covariance matrix of activation states, with performance depending on the nature -- stochastic or deterministic -- of input signals. Remarkably, the modularity and the link density of the reservoir are found to affect RC performances: these results cannot be predicted by models only accounting for simple topological features of the reservoir. Overall, our findings highlight that the complex topological features characterizing biophysical computing systems such as connectomes can be used to design efficient bio-inspired artificial neural networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Valeria d'Andrea, Michele Puppin, Manlio De Domenico. 2022-10-31. Complex topological features of reservoirs shape learning performances in bio-inspired recurrent neural networks. https://arxiv.org/abs/2211.00161

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

R-transforms for non-Hermitian matrices: a spherical integral approach

In this paper, we establish a connection between the formalism of $\mathcal{R}$-transforms for non-Hermitian random matrices and the framework of spherical integrals, using the replica method. This connection was previously proved in the Hermitian setting and in the case of bi-invariant random matrices. We show that the $\mathcal{R}$-transforms used in the non-Hermitian context in fact originate from a single scalar function of two variables. This provides a new and transparent way to compute $\mathcal{R}$-transforms, which until now had been known only in restricted cases such as bi-invariant, Hermitian, or elliptic ensembles.

cond-mat.dis-nn

Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic solutions. In this paper, we illustrate this phenomenon in the context of spectral boundaries (or spectral edges) for deformed random matrices. Specifically, we consider matrices of the form $\mathbf{A} + \mathbf{B}$, where $\mathbf{A}$ is a deterministic $N\times N$ matrix (not necessarily Hermitian) and $\mathbf{B}$ is a rotationally invariant random matrix. In the large-$N$ limit, we show that the complex eigenvalue distribution of $\mathbf{A} + \mathbf{B}$ satisfies remarkably simple boundary equations that depend on the $\mathcal{R}_1$ and $\mathcal{R}_2$ transforms of $\mathbf{B}$. We illustrate our results on several explicit random matrix ensembles and support them with numerical simulations.

cond-mat.dis-nn

Electrical conductivity of crack-template-based transparent conducting films: mean-field approximation, effective-medium theory, and simulation

In this work, crack-template-based transparent conducting films were modeled as networks corresponding to the edges of a two-dimensional Poisson--Voronoi diagram. Two types of networks were considered: the original one, in which the conductance of each edge was inversely proportional to its length, and the effective one, in which all edges had the same conductance obtained from the effective-medium theory. The mean-field approximation was used for analytical evaluation of the electrical conductivity. Direct numerical calculations for the Poisson--Voronoi diagram showed that the mean-field approximation overestimated the effective conductivity of the original network by approximately 13\%, and of the effective network by 79\%. In addition, a honeycomb network with an edge conductance distribution corresponding to the Poisson--Voronoi diagram was studied: for it, the predictions of the effective-medium theory turned out to be more accurate than for the Poisson--Voronoi diagram, which was explained by the greater structural homogeneity of the periodic honeycomb lattice. The results indicate that, when modeling crack-template-based transparent conducting films, the application of the mean-field approximation may lead to significant errors if the resistance of individual conductors is not simply proportional to their length. This possibility is discussed as a motivation for future studies of hierarchical cracks with variable width, which are not directly investigated here.

cond-mat.dis-nn