<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Comput. Neurosci.</journal-id>
<journal-title>Frontiers in Computational Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Comput. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-5188</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fncom.2023.1223258</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Excitatory/inhibitory balance emerges as a key factor for RBN performance, overriding attractor dynamics</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Calvet</surname> <given-names>Emmanuel</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2263724/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Rouat</surname> <given-names>Jean</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/102046/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Reulet</surname> <given-names>Bertrand</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Neurosciences Computationelles et Traitement Intelligent des Signaux (NECOTIS), Facult&#x000E9; de G&#x000E9;nie, G&#x000E9;nie &#x000C9;lectrique et G&#x000E9;nie Informatique (GEGI), Universit&#x000E9; de Sherbrooke</institution>, <addr-line>Sherbrooke, QC</addr-line>, <country>Canada</country></aff>
<aff id="aff2"><sup>2</sup><institution>D&#x000E9;partement de Physique, Facult&#x000E9; des Sciences, Institut Quantique, Universit&#x000E9; de Sherbrooke</institution>, <addr-line>Sherbrooke, QC</addr-line>, <country>Canada</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Guohe Zhang, Xi&#x00027;an Jiaotong University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: J&#x000E9;r&#x000E9;mie Cabessa, Universit&#x000E9; de Versailles Saint-Quentin-en-Yvelines, France; Alessandro E. P. Villa, Neuro-heuristic Research Group (NHRG), Switzerland</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Emmanuel Calvet <email>emmanuel.calvet&#x00040;usherbrooke.ca</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>09</day>
<month>08</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>17</volume>
<elocation-id>1223258</elocation-id>
<history>
<date date-type="received">
<day>15</day>
<month>05</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>07</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2023 Calvet, Rouat and Reulet.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Calvet, Rouat and Reulet</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license></permissions>
<abstract>
<p>Reservoir computing provides a time and cost-efficient alternative to traditional learning methods. Critical regimes, known as the &#x0201C;edge of chaos,&#x0201D; have been found to optimize computational performance in binary neural networks. However, little attention has been devoted to studying reservoir-to-reservoir variability when investigating the link between connectivity, dynamics, and performance. As physical reservoir computers become more prevalent, developing a systematic approach to network design is crucial. In this article, we examine Random Boolean Networks (RBNs) and demonstrate that specific distribution parameters can lead to diverse dynamics near critical points. We identify distinct dynamical attractors and quantify their statistics, revealing that most reservoirs possess a dominant attractor. We then evaluate performance in two challenging tasks, memorization and prediction, and find that a positive excitatory balance produces a critical point with higher memory performance. In comparison, a negative inhibitory balance delivers another critical point with better prediction performance. Interestingly, we show that the intrinsic attractor dynamics have little influence on performance in either case.</p></abstract>
<kwd-group>
<kwd>reservoir computing</kwd>
<kwd>RBN</kwd>
<kwd>criticality</kwd>
<kwd>attractor</kwd>
<kwd>memory</kwd>
<kwd>prediction</kwd>
</kwd-group>
<counts>
<fig-count count="6"/>
<table-count count="0"/>
<equation-count count="7"/>
<ref-count count="49"/>
<page-count count="12"/>
<word-count count="8957"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>Reservoir Computing (RC) is a promising field for Machine Learning (ML), as the nonlinear reservoir requires no learning and the readout layer only needs linear regression (Maass et al., <xref ref-type="bibr" rid="B33">2002</xref>; Jaeger and Haas, <xref ref-type="bibr" rid="B20">2004</xref>), reducing time and computational cost (Schrauwen et al., <xref ref-type="bibr" rid="B43">2007</xref>). Furthermore, it has potential for real-world implementations as physical reservoirs and dedicated Neuromorphic chips do not always possess the ability to adapt (Benjamin et al., <xref ref-type="bibr" rid="B3">2014</xref>; Merolla et al., <xref ref-type="bibr" rid="B37">2014</xref>; Tanaka et al., <xref ref-type="bibr" rid="B47">2019</xref>). Around the same time in 2002, two models were developed: the Liquid State Machine (LSM) (Maass et al., <xref ref-type="bibr" rid="B33">2002</xref>) and the Echo State Network (ESN) (Jaeger, <xref ref-type="bibr" rid="B19">2001</xref>) (rectified version). These approaches differ in their neural models, with LSM using time-event-based neurons and ESNs using Artificial Neural Networks (ANN) with continuous activation functions (Jaeger, <xref ref-type="bibr" rid="B19">2001</xref>). The Random Boolean Network (RBN) (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>), with binary neurons, is a particularly promising model for LSM and allows for a direct relationship between the reservoir design and its performance in a task (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>; Natschl&#x000E4;ger et al., <xref ref-type="bibr" rid="B39">2005</xref>; Snyder et al., <xref ref-type="bibr" rid="B46">2012</xref>). It is widely used to model and implement reservoirs (Rosin, <xref ref-type="bibr" rid="B42">2015</xref>; Burkow and Tufte, <xref ref-type="bibr" rid="B6">2016</xref>; Echlin et al., <xref ref-type="bibr" rid="B16">2018</xref>; Komkov et al., <xref ref-type="bibr" rid="B25">2021</xref>).</p>
<p>Studies on the RBN have demonstrated the existence of a phase transition in the dynamics of the reservoir for specific connectivity parameters. Close to the critical regime, an increase in performance in solving various tasks has been reported [boolean logic operations (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>), bit-parity check (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>), prediction of Mackey-Glass time series (Canaday et al., <xref ref-type="bibr" rid="B11">2018</xref>)]. As of now, most studies in the field of RC rely on phase diagrams to exhibit a statistical relationship between connectivity, dynamics, and performance (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>; B&#x000FC;sing et al., <xref ref-type="bibr" rid="B7">2010</xref>; Snyder et al., <xref ref-type="bibr" rid="B46">2012</xref>; Krauss et al., <xref ref-type="bibr" rid="B26">2019a</xref>; Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>). These results have been obtained by considering a limited number of reservoirs [from one (Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>), to 10 (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>), up to 100 (Krauss et al., <xref ref-type="bibr" rid="B27">2019b</xref>)], and with a limited resolution in terms of the control parameter, due to the computational cost of these phase diagrams.</p>
<p>While phase diagrams are essential to comprehend the full range of the computational capabilities these systems can offer, one crucial point is rarely discussed. Since the reservoirs are randomly generated, there might be huge differences between them even though the statistics of their connectivity are the same. Indeed, close to the critical point, reservoir steady-state activities exhibit a wide range of dynamics as discussed by statistical studies (Kinouchi and Copelli, <xref ref-type="bibr" rid="B24">2006</xref>; Del Papa et al., <xref ref-type="bibr" rid="B15">2017</xref>; Krauss et al., <xref ref-type="bibr" rid="B27">2019b</xref>), and attractor classification (Seifter and Reggia, <xref ref-type="bibr" rid="B44">2015</xref>; Bianchi et al., <xref ref-type="bibr" rid="B5">2016</xref>; Krauss et al., <xref ref-type="bibr" rid="B26">2019a</xref>,<xref ref-type="bibr" rid="B27">b</xref>; Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>).</p>
<p>This article aims at studying the variability of reservoir dynamics, performance, and their correlation. We consider randomly generated RBNs with a single control parameter related to the inhibitory/excitatory balance (Krauss et al., <xref ref-type="bibr" rid="B26">2019a</xref>), tuned with high resolution to perform reliable statistical analysis. We study the excitatory/inhibitory balance, attractor dynamics, and performance, and show that the relationship between the three is more complex than previously thought. In line with the work of (Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>) on ESN, our research reveals that the RBN also possesses two critical points. Depending on whether the balance is in the majority excitatory or inhibitory, we show that reservoirs respectively exhibit optimal performance in either memory or prediction.</p>
<p>The article is organized as follows: in Section 2, we describe the model and prove that it is controlled by the ratio of the standard deviation and mean of the weight distribution (noted &#x003C3;<sup>&#x022C6;</sup>), which we use to perform all subsequent analyses. In Section 3.1, we show that the sign of &#x003C3;<sup>&#x022C6;</sup> produces two critical regimes. In Section 3.2, we classify the activity of free-running reservoirs into four classes according to their attractor dynamics for these two critical regimes. We show that each reservoir can be associated with its most dominant attractor. In Section 4.1, we evaluate the relationship between connectivity, dominant attractor, and performance in memory and prediction tasks. We then investigate the relationship between the performances of the two tasks, critical regimes, and dominant attractors in Section 4.2. This allows us to derive specific recommendations for simplifying the random generation process of reservoirs. Finally, we discuss our findings in Section 5 and their implications for future works in Section 6.</p></sec>
<sec id="s2">
<title>2. Model</title>
<p>The model consists of one input node, the reservoir itself, and an output node (<xref ref-type="fig" rid="F1">Figure 1</xref>). Half of the neurons inside the reservoirs are connected to the input, and the other half to the readout. Thus information between the input and the readout has to pass through the reservoir. The following subsections describe each component and how they are interconnected.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Schematics of the model. The input node <bold>(left)</bold> randomly projects synaptic weights to half of the reservoir <bold>(center)</bold> (green); the reservoir is composed of random recurrent connections (blue); the readout <bold>(right)</bold> receives input from the other half of the reservoir (orange).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-17-1223258-g0001.tif"/>
</fig>
<sec>
<title>2.1. The reservoir</title>
<p>Phase transitions occur <italic>stricto sensu</italic> only in infinite systems, and critical phenomena are easier to observe in large systems (Lavis et al., <xref ref-type="bibr" rid="B31">2021</xref>). As such, we use an RBN model of size <italic>N</italic> &#x0003D; 10, 000 neurons, which is considerable compared to similar studies in the literature (Natschl&#x000E4;ger et al., <xref ref-type="bibr" rid="B39">2005</xref>; B&#x000FC;sing et al., <xref ref-type="bibr" rid="B7">2010</xref>; Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>). The binary state <italic>x</italic><sub><italic>i</italic></sub>(<italic>t</italic>)&#x02208;{0, 1} of the neuron <italic>i</italic> at the time-step <italic>t</italic> (with <italic>t</italic>&#x02208;&#x02115;), is given by:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x003B8;</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003B8; is the Heaviside step function: &#x003B8;(<italic>x</italic>) &#x0003D; 1 if <italic>x</italic>&#x0003E; 0 and &#x003B8;(<italic>x</italic>) &#x0003D; 0 otherwise. Each neuron receives the same number of non-zero connections <italic>K</italic> &#x0003D; 16, in the range of values shown to display sharp phase transitions (B&#x000FC;sing et al., <xref ref-type="bibr" rid="B7">2010</xref>). The non-zero recurrent weights of the reservoir <italic>w</italic><sub><italic>ij</italic></sub> (blue arrows in <xref ref-type="fig" rid="F1">Figure 1</xref>) are i.i.d. and drawn from the Normal or Gaussian density probability function <inline-formula><mml:math id="M2"><mml:mrow><mml:mi mathvariant="script">N</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003BC;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. <italic>u</italic><sub><italic>i</italic></sub>(<italic>t</italic>) is the external input of the neuron <italic>i</italic> at times <italic>t</italic>.</p></sec>
<sec>
<title>2.2. Input node</title>
<p>The input layer reduces to one node, receiving the time series <italic>u</italic>(<italic>t</italic>). The input at times <italic>t</italic> of a given neuron <italic>i</italic> is:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mi>u</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Where the input weight <inline-formula><mml:math id="M4"><mml:msubsup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, of neuron <italic>i</italic> (green arrows in <xref ref-type="fig" rid="F1">Figure 1</xref>) is drawn from a uniform distribution within [&#x02212;0.5, 0.5], and half of the weights are set to zero. According to Eq. 1, if the amplitude of the input far exceeds the total contribution of the recurrent weights, then the input mostly controls the dynamics. Our choice of parameters corresponds to an input of zero average and &#x0007E;0.14 the standard deviation, which is rather low compared to the recurrent weights. We show in part 4.1 that this choice makes the dynamics mostly controlled by the recurrent weights, which is the intended behavior.</p></sec>
<sec>
<title>2.3. Readout</title>
<p>The adaptation mechanism is in the output layer only, which reduces here to one linear node with a sigmoid activation function <inline-formula><mml:math id="M5"><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></inline-formula>. As such, the output of the network is given by:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover><mml:mo>&#x0002B;</mml:mo><mml:mi>c</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Since all experiments consist in reproducing a unidimensional time series, the output <italic>y</italic> is a scalar as well. The column vector <inline-formula><mml:math id="M7"><mml:mover accent="true"><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mover></mml:math></inline-formula> represents the state of the reservoir neurons, while the output weights <italic>W</italic><sup><italic>out</italic></sup> (orange arrows in <xref ref-type="fig" rid="F1">Figure 1</xref>) are stored in a row vector of size <italic>N</italic>, with half of them set to zero. Lastly, the scalar <italic>c</italic> is the bias. The training is performed with a mean square error (MSE) loss function. Since we had a focus on collecting high-quality data regarding the link between connectivity and performance, we chose the ADAM optimizer (Kingma and Ba, <xref ref-type="bibr" rid="B22">2015</xref>) over the more standard Ridge regression (Burkow and Tufte, <xref ref-type="bibr" rid="B6">2016</xref>) often used in the literature. The implementation is made with the PyTorch library, and parameters &#x003B1; &#x0003D; 0.001, and 4, 000 epochs (see <xref ref-type="supplementary-material" rid="SM1">Supplementary material S8.4</xref> for more details).</p></sec>
<sec>
<title>2.4. Connectivity: the control parameter &#x003C3;<sup>&#x022C6;</sup></title>
<p>To study the reservoir dynamics, one needs the proper definition of a control parameter. Previous work on the RBN often focuses on the average and variance of the recurrent weight matrix (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>; Natschl&#x000E4;ger et al., <xref ref-type="bibr" rid="B39">2005</xref>). In the following, we demonstrate the existence of only one control parameter &#x003C3;<sup>&#x022C6;</sup> defined by:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mo>/</mml:mo><mml:mi>&#x003BC;</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mi>&#x003BC;</mml:mi><mml:mo>&#x02260;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Where &#x003BC; is the mean of the weights and &#x003C3; their standard deviation. Here we study the reservoir in the absence of external excitation, <italic>u</italic><sub><italic>i</italic></sub>(<italic>t</italic>) &#x0003D; 0 in Eq. (1). Let us consider two reservoirs with the same architecture, the same initial state, and with respective weights matrices <italic>W</italic> and &#x003BB;<italic>W</italic> with the scalar &#x003BB;&#x0003E; 0. Since &#x003BB;&#x0003E; 0, then &#x003B8;(&#x003BB;<italic>x</italic>) &#x0003D; &#x003B8;(<italic>x</italic>), &#x02200;<italic>x</italic>. Thus, according to Eq. (1) for <italic>u</italic><sub><italic>i</italic></sub>(<italic>t</italic>) &#x0003D; 0, the two networks are always in the same state. Thus (&#x003BB;&#x003BC;, &#x003BB;&#x003C3;) gives rise to the same time evolution as (&#x003BC;, &#x003C3;). The two corresponding reservoirs are totally equivalent. We face two cases depending on &#x003BC;:</p>
<list list-type="bullet">
<list-item><p>When &#x003BC; &#x0003D; 0, choosing &#x003BB; &#x0003D; 1/&#x003C3; leads to the conclusion that all reservoirs (0, &#x003C3;) are strictly equivalent to the reservoir (0, 1). Hence reservoirs with &#x003BC; &#x0003D; 0 are independent of &#x003C3;.</p></list-item>
<list-item><p>When &#x003BC;&#x02260;0, choosing &#x003BB; &#x0003D; 1/|&#x003BC;| leads to the weights of the second reservoir distributed with a mean of &#x000B1;1 and a standard deviation &#x003C3;/|&#x003BC;|. Hence we define the control parameter of the RBN as in Eq. (4).</p></list-item>
</list>
<p>Equation 4 characterizes the distribution of the weights: the mean is the sign of &#x003C3;<sup>&#x022C6;</sup>, and the standard deviation is its absolute value. Other distribution characterizations directly relate to &#x003C3;<sup>&#x022C6;</sup>. For instance, it is controlling the balance <italic>b</italic> between excitation and inhibition, defined by (Krauss et al., <xref ref-type="bibr" rid="B26">2019a</xref>) as:</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M9"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002B;</mml:mo></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mi>S</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E6"><label>(6)</label><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x000B1;</mml:mo></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>With <italic>S</italic> &#x0003D; <italic>S</italic><sub>&#x0002B;</sub>&#x0002B;<italic>S</italic><sub>&#x02212;</sub> &#x0003D; <italic>KN</italic> the total number of synapses, <italic>S</italic><sub>&#x02212;</sub> the number of inhibitory synapses (<italic>w</italic><sub><italic>ij</italic></sub> &#x0003C; 0), and <italic>S</italic><sub>&#x0002B;</sub> the number of excitatory synapses (<italic>w</italic><sub><italic>ij</italic></sub>&#x0003E; 0). By taking a normal weight distribution, the number of excitatory synapses is given by:</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M11"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mo>+</mml:mo></mml:msub><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mstyle displaystyle='true'><mml:mrow><mml:msubsup><mml:mo>&#x0222B;</mml:mo><mml:mn>0</mml:mn><mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x0221E;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msqrt><mml:mi>&#x003C0;</mml:mi></mml:msqrt></mml:mrow></mml:mfrac><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x02212;</mml:mo><mml:msup><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x02212;</mml:mo><mml:mfrac><mml:mi>&#x003BC;</mml:mi><mml:mrow><mml:msqrt><mml:mn>2</mml:mn></mml:msqrt><mml:mi>&#x003C3;</mml:mi></mml:mrow></mml:mfrac><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msup><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></disp-formula>
<p>By substituting Eq. (7) in Eq. (6), we find <inline-formula><mml:math id="M12"><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mtext>Erf</mml:mtext><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msqrt><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msqrt><mml:msup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, with Erf the error function. Thus, by controlling the weight distribution, our control parameter &#x003C3;<sup>&#x022C6;</sup> drives the excitatory to inhibitory balance and thus the reservoir dynamics, in line with Krauss et al. (<xref ref-type="bibr" rid="B27">2019b</xref>) and Metzner and Krauss (<xref ref-type="bibr" rid="B38">2022</xref>). <xref ref-type="fig" rid="F2">Figure 2</xref> shows the relationship between <italic>b</italic> and &#x003C3;<sup>&#x022C6;</sup>. The case &#x003BC; &#x0003D; 0 corresponds to <italic>b</italic> &#x0003D; 0 (perfect balance between excitation and inhibition) and &#x003C3;<sup>&#x022C6;</sup> &#x02192; &#x0221E;, for any value of &#x003C3;. For &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0, <italic>b</italic>&#x02208;[&#x02212;1, 0], i.e. there is a majority of inhibitory synapses while for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0, <italic>b</italic>&#x02208;[0, 1], hence a majority of excitatory synapses.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>Excitation/inhibition balance <italic>b</italic> as a function of the absolute value of the connectivity parameter &#x003C3;<sup>&#x022C6;</sup>, as defined in Eq. 4, for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 <inline-formula><mml:math id="M34"><mml:mrow><mml:mo>(</mml:mo><mml:mstyle mathcolor="#00bdff"><mml:mn>&#x02014;</mml:mn></mml:mstyle><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and &#x003C3;<sup>&#x022C6;</sup>&#x0003E;  0 <inline-formula><mml:math id="M35"><mml:mrow><mml:mo>(</mml:mo><mml:mstyle mathcolor="#ee1c23"><mml:mn>&#x02014;</mml:mn></mml:mstyle><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. When the average of weights is positive (&#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0), whereas the reverse is true when the average of weights is negative.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-17-1223258-g0002.tif"/>
</fig>
<p>To finish, the spectral radius &#x003C1;(<italic>W</italic>) of the weight matrix <italic>W</italic> is a particularly relevant quantity in the context of the ESN, a continuous version of reservoirs, where the critical point corresponds to a spectral radius of one. However, in the case of discontinuous activation functions, such as the one we have with the RBN, it has been shown that the Echo State Property (ESP) cannot be achieved. The spectral radius alone fails to characterize the dynamics and performance of these reservoirs (Oztuik et al., <xref ref-type="bibr" rid="B40">2007</xref>; Alexandre et al., <xref ref-type="bibr" rid="B1">2009</xref>; Tieck et al., <xref ref-type="bibr" rid="B48">2018</xref>; Balafrej et al., <xref ref-type="bibr" rid="B2">2022</xref>). In <xref ref-type="supplementary-material" rid="SM1">Supplementary material S8.1</xref>, we explicitly discuss the link between &#x003C1; and the mean and variance of the weight matrix and show &#x003C1; is of no particular interest in the study of the dynamics.</p>
<p>As a consequence, in the following, we will use &#x003C3;<sup>&#x022C6;</sup> as the unique control parameter (in the range of values displayed in <xref ref-type="supplementary-material" rid="SM1">Supplementary material S8.2</xref>).</p></sec></sec>
<sec id="s3">
<title>3. Statistics of dynamics at the critical points</title>
<p>The importance of neural networks dynamics in understanding their performances has been widely explored (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>; B&#x000FC;sing et al., <xref ref-type="bibr" rid="B7">2010</xref>; Krauss et al., <xref ref-type="bibr" rid="B26">2019a</xref>; Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>). The purpose of this part is to investigate the relationship between connectivity and dynamics through two statistical analyses:</p>
<list list-type="order">
<list-item><p><bold>Activity statistics:</bold> In Section 3.1, we analyze the statistics of the neural activity as a function of the control parameter &#x003C3;<sup>&#x022C6;</sup>. We demonstrate the existence of two critical points and characterize them.</p></list-item>
<list-item><p><bold>Reservoirs attractors:</bold> In Section 3.2, we classify the steady state time evolution of the network activity into four distinct attractors and study the influence of the initial state and random weight generation. We show that reservoirs possess a dominant attractor independent of initial conditions.</p></list-item>
</list>
<sec>
<title>3.1. Statistics of the activity of free-evolving reservoirs</title>
<sec>
<title>3.1.1. Methodology</title>
<p>The first experiment is a free evolution of reservoirs in the absence of input, i.e. <italic>u</italic><sub><italic>i</italic></sub> &#x0003D; 0. We define the network activity as <inline-formula><mml:math id="M13"><mml:mi>A</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder class="msub"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mi>N</mml:mi></mml:math></inline-formula>, with <italic>N</italic> the number of neurons in the reservoir, and <italic>A</italic>&#x02208;[0, 1]. <italic>A</italic> is also the proportion of excited neurons: <italic>A</italic> &#x0003D; 0 if the network is extinguished (<italic>x</italic><sub><italic>i</italic></sub> &#x0003D; 0 &#x02200;<italic>i</italic>), <italic>A</italic> &#x0003D; 1 if the network is saturated (<italic>x</italic><sub><italic>i</italic></sub> &#x0003D; 1 &#x02200;<italic>i</italic>). At the initial state, we randomly force 20% of neurons to an up state (<italic>x</italic><sub><italic>i</italic></sub> &#x0003D; 1), i.e. <italic>A</italic>(<italic>t</italic> &#x0003D; 0) &#x0003D; 0.2. After a transient regime of 1, 000 time steps, the reservoir reaches a steady state where we perform statistics. In the following, <italic>A</italic> will refer to the activity measured in that steady state (see <xref ref-type="supplementary-material" rid="SM1">Supplementary material S9</xref> for a more formal definition). For each value of &#x003C3;<sup>&#x022C6;</sup>, we perform statistics on 100 randomly generated reservoirs (see <xref ref-type="supplementary-material" rid="SM1">Supplementary material S7.1</xref> for more details on the experiment).</p></sec>
<sec>
<title>3.1.2. Analysis</title>
<p>In the following, a bar over a variable <inline-formula><mml:math id="M14"><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>.</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:math></inline-formula> represents an average over time for a given reservoir, while the brackets &#x02329;.&#x0232A; represents an average over different randomly generated reservoirs. In the first analysis, we calculate the time-average steady activity &#x00100; for a given reservoir and its time-variance <inline-formula><mml:math id="M15"><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:math></inline-formula>, where we define &#x003B4;<italic>A</italic> &#x0003D; <italic>A</italic>&#x02212;&#x00100;. We average these quantities over the reservoirs to give &#x02329;&#x00100;&#x0232A; and <inline-formula><mml:math id="M16"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> for each value of &#x003C3;<sup>&#x022C6;</sup>. Next, we evaluate the average and variance over reservoirs of the binary entropy <italic>H</italic><sub><italic>b</italic></sub>, or BiEntropy (Croll, <xref ref-type="bibr" rid="B13">2014</xref>) of the time-dependent activity. Compared to the Shanon entropy, the advantage of this metric is that it can discriminate ordered from disordered strings of binary digits. It has been used in machine learning (Mamun et al., <xref ref-type="bibr" rid="B34">2016</xref>; Zhou and Zeng, <xref ref-type="bibr" rid="B49">2022</xref>), but to our knowledge, this is the first time in reservoir computing. The binary entropy varies between 0 for fully ordered bit-streams and 1 for fully disordered ones. We compute the BiEntropy of the binarized time dependence of the steady activity for each reservoir (for the exact definition of all the metrics, see <xref ref-type="supplementary-material" rid="SM1">Supplementary material S10</xref>).</p></sec>
<sec>
<title>3.1.3. Results</title>
<p>The time-average activity &#x02329;&#x00100;&#x0232A; as a function of &#x003C3;<sup>&#x022C6;</sup> is shown in <xref ref-type="fig" rid="F3">Figure 3A</xref>, for both signs of &#x003C3;<sup>&#x022C6;</sup> (<xref ref-type="fig" rid="F2">Figure 2</xref>). The green dashed line represents the value obtained for &#x003BC; &#x0003D; 0, i.e. &#x003C3; &#x02192; &#x0221E;. The perfect balance in excitation (<italic>b</italic> &#x0003D; 0) results in half of the neurons being activated &#x02329;&#x00100;&#x0232A; &#x0003D; 0.5. The variance <inline-formula><mml:math id="M17"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> vs. &#x003C3;<sup>&#x022C6;</sup> is shown in <xref ref-type="fig" rid="F3">Figure 3C</xref>. For the lowest values of |&#x003C3;<sup>&#x022C6;</sup>|, the reservoirs are frozen (zero variance) either extinguished (for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0) or saturated (&#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0). This corresponds to reservoirs being respectively purely inhibitory (<italic>b</italic> &#x0003D; &#x02212;1) or excitatory (<italic>b</italic> &#x0003D; 1). Already at the level of the statistics of the activity, there is a clear difference between both signs of &#x003C3;<sup>&#x022C6;</sup>: for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 there is a threshold in &#x003C3;<sup>&#x022C6;</sup> (vertical dashed line at &#x003C3;<sup>&#x022C6;</sup>&#x0007E;&#x02212;0.7) above which the average activity and its variance rise abruptly and simultaneously. In contrast, for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0, there is a wide region where no dynamic is detected (zero variance), yet the network is not saturated but its activity decays continuously. The variance starts rising at &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 4 (vertical dash-dotted line).</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Statistics of the activity of free running reservoirs in the steady state as a function of |&#x003C3;<sup>&#x022C6;</sup>|. Each dot represents the statistics over 100 reservoirs ran once. Average over reservoirs of time average activity &#x02329;&#x00100;&#x0232A; <bold>(A)</bold>, and average over reservoir of time variance <inline-formula><mml:math id="M18"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> <bold>(C)</bold>, for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 (<inline-formula><mml:math id="M36"><mml:mrow><mml:mstyle mathcolor="#0000ff"><mml:mn>&#x025BE;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>) and &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 (<inline-formula><mml:math id="M37"><mml:mrow><mml:mstyle mathcolor="#ff0000"><mml:mn>&#x025B4;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>). In all plots, the gray vertical lines represent the critical values of the control parameter for <inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x0003C;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> (<italic>---</italic>) and <inline-formula><mml:math id="M20"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x0003E; </mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> (-.-.). <bold>(B</bold>, <bold>D)</bold> Zoom on the region of interest close to the critical points: average over reservoirs of BiEntropy &#x02329;<italic>H</italic><sub><italic>b</italic></sub>&#x0232A; (&#x022C6;, left scale) and BiEntropy variance <inline-formula><mml:math id="M21"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msubsup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math id="M38"><mml:mrow><mml:mstyle mathcolor="#ffff00"><mml:mn>&#x02022;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>, right scale), for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 <bold>(B)</bold> and &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 <bold>(D)</bold>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-17-1223258-g0003.tif"/>
</fig>
<p>The average BiEntropy &#x02329;<italic>H</italic><sub><italic>b</italic></sub>&#x0232A; vs. |&#x003C3;<sup>&#x022C6;</sup>| is plotted in <xref ref-type="fig" rid="F3">Figure 3B</xref> for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 and <xref ref-type="fig" rid="F3">Figure 3D</xref> for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 (left scale, black stars on both plots). These two plots zoom in the vicinity of the phase transition, as statistics are stationary elsewhere. There is a continuous transition between a fully ordered phase (&#x02329;<italic>H</italic><sub><italic>b</italic></sub>&#x0232A; &#x0003D; 0) and a fully disordered one (&#x02329;<italic>H</italic><sub><italic>b</italic></sub>&#x0232A; &#x0003D; 1). Since the BiEntropy is a measure of order, these results suggest that the transition we observe is related to the apparition of chaos in the reservoir above a critical value of &#x003C3;<sup>&#x022C6;</sup> (Lewin and Bak, <xref ref-type="bibr" rid="B32">1993</xref>; Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>; Seifter and Reggia, <xref ref-type="bibr" rid="B44">2015</xref>; Ku&#x0015B;mierz et al., <xref ref-type="bibr" rid="B28">2020</xref>). The variance of the BiEntropy <inline-formula><mml:math id="M22"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msubsup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> is shown in <xref ref-type="fig" rid="F3">Figure 3B</xref> for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 and <xref ref-type="fig" rid="F3">Figure 3D</xref> for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 (right scale, orange circles on both plots). It is zero when either in the ordered or disordered phase and spikes at the transition. Its maximum coincides with &#x02329;<italic>H</italic><sub><italic>b</italic></sub>&#x0232A;&#x02243;0.5: the variance of BiEntropy captures the edge of chaos as a balance between order and disorder. More striking, it also coincides with the position at which the variance of the activity rises (vertical dashed lines). The peak of <inline-formula><mml:math id="M23"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msubsup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> thus provides a clear definition of the position of two critical points: <inline-formula><mml:math id="M24"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02243;</mml:mo><mml:mo>-</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>66</mml:mn></mml:math></inline-formula> and <inline-formula><mml:math id="M25"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02243;</mml:mo><mml:mn>4</mml:mn><mml:mo>.</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, which correspond respectively to critical balances <italic>b</italic><sub><italic>c</italic></sub>&#x02243;&#x02212;0.87 (94% of inhibitory synapses) and <italic>b</italic><sub><italic>c</italic></sub>&#x02243;0.19 (60% of excitatory synapses). Moreover, the transition between order and disorder is much wider for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0. This asymmetry between both signs of &#x003C3;<sup>&#x022C6;</sup> is a property of our model since &#x003B8;(&#x02212;<italic>x</italic>)&#x02260;&#x000B1;&#x003B8;(<italic>x</italic>) in Eq.(1). From now on, we will refer to the <italic>critical points</italic> as the point where the maximum of BiEntropy variance is obtained, and we will define the <italic>critical regions</italic> as the regions with <inline-formula><mml:math id="M26"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msubsup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow><mml:mo>&#x02260;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>.</p></sec>
<sec>
<title>3.1.4. Discussion</title>
<p>Similar to (Krauss et al., <xref ref-type="bibr" rid="B27">2019b</xref>) and (Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>), the existence of phases separated by critical points as a parameter is varied is reminiscent of the phase diagrams drawn in thermodynamics. If we associate the state of a neuron, 0 or 1, to the state of an Ising spin, either down or up, then &#x02329;&#x00100;&#x0232A; corresponds to the average magnetization per spin of the network and <inline-formula><mml:math id="M27"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> to the variance of its fluctuations, i.e., magnetization noise. At equilibrium, it is proportional to the magnetic susceptibility according to the fluctuation-dissipation theorem (Callen and Welton, <xref ref-type="bibr" rid="B9">1951</xref>). The total magnetization plays the role of an order parameter, and the transition order is obtained by considering discontinuities, as a function of temperature, of the order parameter and its derivatives with respect to the external field (Landau and Lifshitz, <xref ref-type="bibr" rid="B30">1980</xref>). Here we observe that the average activity is always continuous as a function of &#x003C3;<sup>&#x022C6;</sup>. At the same time, <inline-formula><mml:math id="M28"><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mi>&#x003B4;</mml:mi><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:math></inline-formula> is continuous for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 but shows a discontinuity at the critical point for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0. This strongly suggests that the two &#x0201C;phase transitions&#x0201D; are of a different type.</p></sec></sec>
<sec>
<title>3.2. Dominant attractor of reservoirs</title>
<p>In the previous section, we considered the <italic>average</italic> behavior of reservoirs: for a given value of &#x003C3;<sup>&#x022C6;</sup> we averaged over many realizations of the distribution of synaptic weights. However, from a practical point of view, one wants to use one network to work with different inputs. This raises two questions: that of the reservoir-to-reservoir variability (do all reservoirs behave similarly?) and that of the sensitivity of a given reservoir to initial conditions. We address these questions in this section.</p>
<sec>
<title>3.2.1. Methodology</title>
<p>We submitted our reservoirs again to a free evolution without input [<italic>u</italic><sub><italic>i</italic></sub>(<italic>t</italic>) &#x0003D; 0]. For each value of &#x003C3;<sup>&#x022C6;</sup>, we created 100 reservoirs with randomly tossed weight matrices. Each reservoir is run 100 times, with a different random initial state, of activity <italic>A</italic>(<italic>t</italic> &#x0003D; 0) &#x0003D; 0.2 (for more details, see <italic>Statistics of reservoirs</italic> in <xref ref-type="supplementary-material" rid="SM1">Supplementary material S7</xref>).</p></sec>
<sec>
<title>3.2.2. Analysis</title>
<p>We classify the attractor obtained in the steady-state activities, as proposed in (Krauss et al., <xref ref-type="bibr" rid="B26">2019a</xref>). We categorize the activity signals into one of the four types of attractors (see <xref ref-type="supplementary-material" rid="SM1">Supplementary material S11</xref> for a grounded justification of each category):</p>
<list list-type="bullet">
<list-item><p><italic>Extinguished</italic> activity: The steady-state activity <italic>A</italic>(<italic>t</italic>) is always zero. This means that the initial activity died during the transient phase and that the reservoir could not propagate it further in time. For simplicity, we will sometime refer to it as <italic>dead</italic> attractor.</p></list-item>
<list-item><p><italic>Fixed</italic> point attractor: The steady-state reservoir is active [<italic>A</italic>(<italic>t</italic>)&#x02260;0], but the activity is independent of time [&#x003B4;<italic>A</italic>(<italic>t</italic>) &#x0003D; 0]. This includes the <italic>saturated</italic> states <italic>A</italic>(<italic>t</italic>) &#x0003D; 1 of Seifter and Reggia (<xref ref-type="bibr" rid="B44">2015</xref>).</p></list-item>
<list-item><p><italic>Cyclic</italic> attractor: <italic>A</italic>(<italic>t</italic>) is periodic with a periodicity larger than one time-step.</p></list-item>
<list-item><p><italic>Irregular</italic> attractor: <italic>A</italic>(<italic>t</italic>) is neither constant nor periodic within the duration of the simulation. Note that since the RBN is finite, discrete, and deterministic, given enough time, any sequence of states should eventually repeat, taking at most 2<sup><italic>N</italic></sup> time steps.</p></list-item>
</list>
<p>We determine the attractor obtained at the steady state for each reservoir and initial condition. We then compute the distribution of attractors for each value of &#x003C3;<sup>&#x022C6;</sup> obtained overall the initial conditions of all reservoirs. The statistics are thus computed on 10,000 steady activities for each &#x003C3;<sup>&#x022C6;</sup>.</p></sec>
<sec>
<title>3.2.3. Results:</title>
<p><xref ref-type="fig" rid="F4">Figures 4A</xref>&#x02013;<xref ref-type="fig" rid="F4">F</xref> provide examples of attractors, encoded in the colors, for each reservoir (x-axis) and each initial condition (y-axis) for different values of &#x003C3;<sup>&#x022C6;</sup>. The left column (blue-bordered boxes) corresponds to values below the critical point (vertical blue lines on <xref ref-type="fig" rid="F4">Figures 4G</xref>, <xref ref-type="fig" rid="F4">H</xref>), the center column (gray-bordered boxes) to values at the critical point (vertical gray lines), and the right column (red-bordered boxes) to values above the critical points (vertical red lines). The upper row displays negative &#x003C3;<sup>&#x022C6;</sup> values, while the lower row features positive &#x003C3;<sup>&#x022C6;</sup> values.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>The attractor landscape of reservoirs: for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 <bold>(A&#x02013;C</bold>, <bold>G)</bold>, and for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 <bold>(D&#x02013;F</bold>, <bold>H)</bold>. The influence of initial conditions for specific values of &#x003C3;<sup>&#x022C6;</sup>: <bold>(A)</bold> &#x003C3;<sup>&#x022C6;</sup> &#x0003D; &#x02212;0.6, <bold>(B)</bold> &#x003C3;<sup>&#x022C6;</sup> &#x0003D; &#x02212;0.66, <bold>(C)</bold> &#x003C3;<sup>&#x022C6;</sup> &#x0003D; &#x02212;0.689, <bold>(D)</bold> &#x003C3;<sup>&#x022C6;</sup> &#x0003D; 2.4, <bold>(E)</bold> &#x003C3;<sup>&#x022C6;</sup> &#x0003D; 4.0, <bold>(F)</bold> &#x003C3;<sup>&#x022C6;</sup> &#x0003D; 5.0. In each plot, the vertical axis represents different numbers (&#x00023;) of initial random states of free-running reservoirs. The horizontal axis represents different numbers (&#x00023;) of reservoirs with various initial weight tossing, randomly generated with distinct seeds. Pixels of colors represent the attractor obtained at the steady state, with the same colors as <bold>(G, H)</bold>. <bold>(G, H)</bold> Percentage of steady-state activities belonging to each category of attractors: no-activity (<inline-formula><mml:math id="M39"><mml:mrow><mml:mstyle mathcolor="#1e90ff"><mml:mn>&#x0002B;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>), fix (<inline-formula><mml:math id="M40"><mml:mrow><mml:mstyle mathcolor="#4fd14f"><mml:mn>&#x02022;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>), cyclic (<inline-formula><mml:math id="M41"><mml:mrow><mml:mstyle mathcolor="#ffd700"><mml:mn>&#x02022;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>), and irregular (<inline-formula><mml:math id="M42"><mml:mrow><mml:mstyle mathcolor="#ff4500"><mml:mn>&#x02666;</mml:mn></mml:mstyle></mml:mrow></mml:math></inline-formula>). Each dot represents the statistics over 100 reservoirs ran 100 times, hence 1, 000 runs. In each row <bold>(A&#x02013;C, E&#x02013;G)</bold>, the colored dashed boxes surrounding the plots correspond to the values of &#x003C3;<sup>&#x022C6;</sup>, indicated as vertical lines in plots <bold>(G, H)</bold>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-17-1223258-g0004.tif"/>
</fig>
<p>Away from the critical point, a dominant color is observed, meaning that reservoirs exhibit a dominant attractor. Steady activities are predominantly extinguished and fixed on the left side of the critical point (<xref ref-type="fig" rid="F4">Figures 4A</xref>, <xref ref-type="fig" rid="F4">D</xref>) and irregular at the right (<xref ref-type="fig" rid="F4">Figures 4C</xref>, <xref ref-type="fig" rid="F4">F</xref>). Close to the critical points (<xref ref-type="fig" rid="F4">Figures 4B</xref>, <xref ref-type="fig" rid="F4">E</xref>), there is an increase in the diversity of attractors, as previously observed (Karimipanah et al., <xref ref-type="bibr" rid="B21">2017</xref>).</p>
<p><xref ref-type="fig" rid="F4">Figures 4G</xref>, <xref ref-type="fig" rid="F4">H</xref> show the statistical distribution of all obtained attractors vs. |&#x003C3;<sup>&#x022C6;</sup>|. As expected from the previous analysis, there is no attractor diversity on the far left and right of the plots, as we obtain one primary attractor. Dead (blue line) or fixed (green line) attractors are found for low values of |&#x003C3;<sup>&#x022C6;</sup>|, and their proportion decays slowly across the transition. Within the critical region coexist all attractors in various proportions. Chaotic attractors start to appear precisely at the transition (vertical gray lines), while the domain where cyclic attractors exist coincides with the critical region of nonzero BiEntropy variance (<xref ref-type="fig" rid="F3">Figures 3B</xref>, <xref ref-type="fig" rid="F3">D</xref>). The point at which cyclic attractors are most present is also precisely <inline-formula><mml:math id="M29"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>. These results corroborate what we inferred in the previous section: on the disordered phase <inline-formula><mml:math id="M30"><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msup><mml:mo>|</mml:mo><mml:mo>&#x0003E; </mml:mo><mml:mo>|</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup><mml:mo>|</mml:mo></mml:math></inline-formula>, attractors are irregular, while the ordered phase is characterized by fixed or dead attractors. We note an asymmetry between both sides of the transition: irregular attractors appear only in the disordered phase. From the point of view of the attractors, both signs of &#x003C3;<sup>&#x022C6;</sup> lead to similar behaviors, except again, that the transition region is much wider for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0.</p></sec>
<sec>
<title>3.2.4. Discussion</title>
<p>Our results suggest that the critical points enhance sensitivity to the initial states and configuration of the weights, explaining the reservoir-to-reservoir variance and increase in dynamic diversity. Reservoirs around the negative <inline-formula><mml:math id="M31"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> (<xref ref-type="fig" rid="F4">Figure 4B</xref>) possessed a distribution of attractors with far more variety than the one with positive <inline-formula><mml:math id="M32"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> (<xref ref-type="fig" rid="F4">Figure 4E</xref>), further reinforcing the idea that the sign of &#x003C3;<sup>&#x022C6;</sup> produces two distinct types of critical regimes. We quantified this in the <xref ref-type="supplementary-material" rid="SM1">Supplementary material S12</xref> by computing the entropy of reservoir attractor distributions plotted in <xref ref-type="supplementary-material" rid="SM1">Supplementary Figure 9</xref>. We interpret that result by suggesting that inhibition might be a key factor for enhancing dynamic diversity.</p>
<p>For the purpose of reservoir design, our findings suggest that with both critical points, most reservoirs possess an attractor obtained predominantly in most trials, independent of the initial state. The statistics of dominant reservoir attractors are presented in <xref ref-type="supplementary-material" rid="SM1">Supplementary Figure 9</xref>, and found to be similar to the one in <xref ref-type="fig" rid="F3">Figure 3</xref>. The presence of vertical color lines in <xref ref-type="fig" rid="F4">Figures 4A</xref>&#x02013;<xref ref-type="fig" rid="F4">F</xref> means that, in most cases, the behavior of the reservoirs does not depend on the initial state, even in the critical region (this is more thoroughly shown in the <xref ref-type="supplementary-material" rid="SM1">Supplementary material S12</xref>). As a consequence, a dominant attractor can be associated with each reservoir, irrespective of the initial condition.</p></sec></sec></sec>
<sec id="s4">
<title>4. What drives performances</title>
<p>In this section, we examine whether there is a relationship between reservoir dynamics in the absence of input, as explored in the previous section, and its ability to perform two demanding tasks: memory and prediction. This is done in two steps:</p>
<list list-type="bullet">
<list-item><p>Connectivity, attractor, and performance: In Section 4.1, we analyze the performance obtained separately in each task, depending on the control parameter, for each dominant attractor category. We show that the key factor driving performance is the excitatory/inhibitory balance.</p></list-item>
<list-item><p>Attractor and cross-task performance: In section 4.2, we analyze all reservoir performances independently of the control parameter. For each reservoir, we study the relationship between the performance obtained in each task and their dominant attractor. This allows us to deduce how to generate a reservoir for the best general purpose.</p></list-item>
</list>
<p>From now on, and for ease of notation, a reservoir with a dominant attractor obtained during free evolution (defined in previous Section 3.2) will be referred to as either: a <italic>extinguished, fix, cyclic</italic>, or <italic>irregular</italic> reservoir (e.g., an <italic>extinguished reservoir</italic> refers to a reservoir with an extinguished dominant attractor).</p>
<sec>
<title>4.1. Performance in memory and prediction tasks</title>
<p>Close to the critical points, we obtained various dominant attractors for a single value of &#x003C3;<sup>&#x022C6;</sup>. This raises an important question regarding the relationship between the dominant attractor of a reservoir and its performance. Specifically, it is worth investigating whether the dominant attractor influences the reservoir&#x00027;s performance. If this is the case, grouping attractor categories by discrete performance levels may be possible based on a single value of &#x003C3;<sup>&#x022C6;</sup>.</p>
<sec>
<title>4.1.1. Methodolody</title>
<p>We evaluate the performance of the networks to execute two fundamental tasks: <italic>memory</italic> and <italic>prediction</italic>. Each reservoir receives an input <italic>u</italic>(<italic>t</italic>), and the readout target is <italic>T</italic>(<italic>t</italic>) &#x0003D; <italic>u</italic>(<italic>t</italic>&#x0002B;&#x003B4;), equal to the input shifted in time by &#x003B4; time steps. &#x003B4; &#x0003C; 0 corresponds to a memory task, and &#x003B4;&#x0003E; 0 to a prediction task. For each value of &#x003C3;<sup>&#x022C6;</sup>, we use 100 reservoirs, and each reservoir is run five times, with a different random tossing of the input weight matrix (more detail on the training procedure in <xref ref-type="supplementary-material" rid="SM1">Supplementary material S8.4</xref>).</p>
<p>The first task consists of memorizing a purely random signal (i.e., uncorrelated white noise), and since there is absolutely no correlation in the input, only memorization is involved. <xref ref-type="fig" rid="F5">Figure 5A</xref> illustrates this task for one value of &#x003B4; &#x0003D; &#x02212;6, with white noise as input <italic>u</italic>, and the target <italic>T</italic>.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Performances for two tasks: white noise memory <bold>(C, E)</bold>; and Mackey-glass prediction <bold>(D, F)</bold>. <bold>(A, D)</bold> Examples of signals for each task with their respective parameters. <bold>(A)</bold> White noise memory task, which consists in remembering the input (gray), to reproduce it in output (dark red) with a negative delay &#x003B4; (shown example corresponds to &#x003B4; &#x0003D; &#x02212;6). <bold>(B)</bold> Mackey glass is controlled by the parameter &#x003C4; (see methodology <xref ref-type="supplementary-material" rid="SM1">Supplementary material S8.3</xref> for more details), ranging from periodic to chaotic. <bold>(C&#x02013;F)</bold> The average performance <italic>Corr</italic>(<italic>y, T</italic>) between the output <italic>y</italic> and target <italic>T</italic>, plotted over |&#x003C3;<sup>&#x022C6;</sup>|, for each dominant attractor category <italic>no-activity, fix, cyclic</italic> or <italic>irregular</italic>. For each value of &#x003C3;<sup>&#x022C6;</sup> we have 100 reservoirs. The solid line then represents the average over reservoirs belonging to the same attractor category; individual reservoir performances are averaged over 5 initial conditions. The shaded area represents one standard deviation. Higher correlations indicate better performance. The hatched gray area represents the critical regions, as defined in Section 3.1. <bold>(C, D)</bold> The performance in the white-noise memory task; three values of &#x003B4; are tested &#x02212;2 (&#x022C6;), &#x02212;6 (&#x02022;), &#x02212;10 (&#x025BE;). <bold>(E, F)</bold> The performance of Mackey-Glass prediction (&#x003B4; &#x0003D; &#x0002B;10); three values of &#x003C4; are tested 5 (&#x022C6;), 20 (&#x022C6;), and 50 (&#x025BE;). <bold>(C, D)</bold> Performance for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0, with inside each plot a zoom on the critical region. <bold>(E, F)</bold> Performance for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-17-1223258-g0005.tif"/>
</fig>
<p>For the second task, we explore the ability of the reservoir to predict a time series, &#x003B4; &#x0003D; 10 time steps in the future. The input is the well-known Mackey-Glass time series, as it is a common benchmark of this type of task (Hajnal and L&#x000F6;rincz, <xref ref-type="bibr" rid="B18">2006</xref>; Goudarzi et al., <xref ref-type="bibr" rid="B17">2016</xref>; Canaday et al., <xref ref-type="bibr" rid="B11">2018</xref>, among others), notably testing the ability to infer non-linear dynamics. The signal regularity is controlled by the parameter &#x003C4;, see <xref ref-type="fig" rid="F5">Figure 5B</xref>, ranging from periodic with &#x003C4; &#x0003D; 5, to chaotic for &#x003C4; &#x0003D; 28 (more information on the experiments in <xref ref-type="supplementary-material" rid="SM1">Supplementary material 8.3</xref>).</p></sec>
<sec>
<title>4.1.2. Analysis</title>
<p>The performance of a reservoir is measured by computing the correlation product <italic>Corr</italic>(<italic>y, T</italic>) between the output <italic>y</italic> and the target <italic>T</italic>. A perfect match corresponds to a correlation of one, while a random output gives a zero correlation. An individual reservoir performance score is then obtained by averaging over the initial conditions. Each individual reservoir is associated with its dominant attractor, and the statistics of the performance of reservoirs are performed separately for each attractor.</p></sec>
<sec>
<title>4.1.3. Results</title>
<p>The average performance is plotted as a function of |&#x003C3;<sup>&#x022C6;</sup>| in <xref ref-type="fig" rid="F5">Figures 5C</xref>, <xref ref-type="fig" rid="F5">E</xref> for the memory task and in <xref ref-type="fig" rid="F5">Figures 5D</xref>, <xref ref-type="fig" rid="F5">F</xref> for the prediction task. The left column (<xref ref-type="fig" rid="F5">Figures 5C</xref>, <xref ref-type="fig" rid="F5">D</xref>) corresponds to &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0, and the right column (<xref ref-type="fig" rid="F5">Figures 5E</xref>, <xref ref-type="fig" rid="F5">F</xref>) to &#x003C3; &#x0003C; 0. The color of the lines corresponds to the attractor.</p>
<p>For &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 (<xref ref-type="fig" rid="F5">Figures 5C</xref>, <xref ref-type="fig" rid="F5">D</xref>), performance increases over a very wide range of &#x003C3;<sup>&#x022C6;</sup>, both for memory and prediction. This range includes the critical region (gray hatched area) but is vastly broader. Thus, being within the critical region is absolutely not mandatory to perform well. A shaded area in <xref ref-type="fig" rid="F5">Figure 5</xref> indicates the spreading of the results. There is none in plots <xref ref-type="fig" rid="F5">Figures 5C</xref>, <xref ref-type="fig" rid="F5">D</xref>, meaning that all reservoirs perform exactly the same for a given &#x003C3;<sup>&#x022C6;</sup>. Moreover, as &#x003C3;<sup>&#x022C6;</sup> is increased through the critical region, the dominant attractors change [see zooms in plot <xref ref-type="fig" rid="F5">Figures 5C</xref>, <xref ref-type="fig" rid="F5">D</xref>], but surprisingly, there is no discontinuity in the performance. Indeed, inside the gray area, even though the four attractor categories are present, their respective performance all align. This strongly suggests that the dynamics of the reservoir, as measured in the absence of input, is irrelevant for the performance. Only the value of &#x003C3;<sup>&#x022C6;</sup> matters. In both tasks, the average performance decreases monotonically with increasing difficulty via &#x003C4; and &#x003B4;. In the memory task, we register a dip in performance close to the critical point. This goes against the common assumption that the edge of chaos is optimal for memory (Natschl&#x000E4;ger et al., <xref ref-type="bibr" rid="B39">2005</xref>). In the prediction task, the peak of performance roughly coincides with the critical region, except for the greater difficulty, where the peak is slightly on the left.</p>
<p>The picture is very different for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 (<xref ref-type="fig" rid="F5">Figures 5E</xref>, <xref ref-type="fig" rid="F5">F</xref>). First, the region in which some level of performance is observed is comparable to the critical region observed in free-running reservoirs. Second, there is substantial variability in performance across different reservoirs, as indicated by the large shaded areas. Despite this variability, there is an overall dependence of performance on &#x003C3;<sup>&#x022C6;</sup>. The average performance of distinct dominant attractor categories is much noisier. However, despite being more noisy, the average performance of the distinct attractor categories aligns again, so there is still no evidence that the attractor category has any significant impact on the reservoir&#x00027;s performance. We observe that performance decreases as the difficulty of the memorization task increases, but interestingly, this trend appears to be inverted in the prediction task.</p>
<p>Once again, the two signs of &#x003C3;<sup>&#x022C6;</sup> give rise to different behavior. In particular, networks with &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 memorize better and are less reliable than those with &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 but have poorer prediction capability. Yet, in all cases, attractors do not seem to be correlated to performance, as the top performance can be found in any of the four attractor categories.</p></sec>
<sec>
<title>4.1.4. Discussion</title>
<p>Our results somewhat challenge the common assumption that the edge of chaos is optimal for performance and suggest that this is true for reservoirs with a majority of excitation but not necessarily with a majority of inhibition. Reservoirs with negative &#x003C3;<sup>&#x022C6;</sup> exhibit very reliable performances with very low reservoir-to-reservoir variability over a range in &#x003C3;<sup>&#x022C6;</sup> much broader than the critical region. Since reservoirs behave the same, in practice, it is sufficient to generate one, with &#x003C3;<sup>&#x022C6;</sup> at the left of the critical region. However, if the goal is optimal memorization, it is wiser to choose &#x003C3;&#x0007E;0.4 in the critical region and try different reservoirs until finding a good one, which requires training and testing.</p></sec></sec>
<sec>
<title>4.2. Cross-task performance</title>
<p>Beyond studying the performance in memorization and prediction separately, as often done (Bertschinger and Natschl&#x000E4;ger, <xref ref-type="bibr" rid="B4">2004</xref>; B&#x000FC;sing et al., <xref ref-type="bibr" rid="B7">2010</xref>), here we aim at answering the following question: are the reservoirs intrinsically good or bad, or does it depend on the task? In other words, are there general-purpose reservoirs and specialized ones?</p>
<sec>
<title>4.2.1. Analysis</title>
<p>We analyze the absolute value of the performance of all reservoirs independently of the control parameter. For each reservoir, we study its performance in the memory task as a function of its performance in the prediction tasks (see Section 4.1 <italic>methodology</italic>). For this, we fixed values of &#x003B4; (memory) and &#x003C4; (prediction), and we chose three levels of difficulty: simple (&#x003C4; &#x0003D; 5, &#x003B4; &#x0003D; &#x02212;2), average (&#x003C4; &#x0003D; 20, &#x003B4; &#x0003D; &#x02212;6) and difficult (&#x003C4; &#x0003D; 28, &#x003B4; &#x0003D; &#x02212;10).</p></sec>
<sec>
<title>4.2.2. Results</title>
<p><xref ref-type="fig" rid="F6">Figure 6</xref> displays the performance of reservoirs as colored dots. As in the previous section, each color corresponds to the dominant attractor of the reservoir. The vertical axis represents the performance in the prediction task (Mackey-Glass), and the horizontal axis that of the memory task (white noise). The columns correspond to the sign of &#x003C3;<sup>&#x022C6;</sup>, negative on the left, positive on the right. The rows correspond to the degree of difficulty, from simple (top) to difficult (bottom).</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>The performance of all reservoirs in the prediction tasks (Mackey-Glass) as a function of their performance in the memory tasks (white-noise), for &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 <bold>(A&#x02013;C)</bold> and &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 <bold>(D&#x02013;F)</bold>. Reservoirs are again classified according to their dominant attractor (see <xref ref-type="supplementary-material" rid="SM1">Supplementary material S13</xref>). Each dot represents an individual reservoir performance averaged over 5 initial conditions. In all plots, dots with black edges display reservoirs taken at the critical regimes. We chose three different pairs of values for the parameters of the tasks, &#x003C4; and &#x003B4;, each representing a different difficulty level: 1. Simple <bold>(A, D)</bold> the lowest difficulty in both tasks, &#x003C4; &#x0003D; 5 and &#x003B4; &#x0003D; &#x02212;2; 2. Average <bold>(B, E)</bold> average difficulty for intermediary values of &#x003C4; &#x0003D; 20 and &#x003B4; &#x0003D; &#x02212;6; 3. Difficult <bold>(C, F)</bold> difficult task for higher values of &#x003C4; &#x0003D; 28 and &#x003B4; &#x0003D; &#x02212;10.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-17-1223258-g0006.tif"/>
</fig>
<p>For &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 (left column), there is an apparent relationship in performance between the two tasks. The degree of difficulty roughly acts as a scaling factor on the curves, but the correlation is always clear. The reservoirs which are good at predicting do memorize well as well. There is, however, a reentrant region of irregular reservoirs (red) which are the best at memorizing but are not optimal for predicting, in particular for the intermediate degree of difficulty (see the red loop on <xref ref-type="fig" rid="F6">Figure 6B</xref>). This point corresponds to the maximum on the right of the dip observed in <xref ref-type="fig" rid="F5">Figure 5C</xref>. Interestingly, in all difficulties, reservoirs at the critical point (encircled dots) create a narrow area with a good overall performance. This picture refines our previous analysis of the impact of attractors on performance, as it seems that extinguished reservoirs can perform slightly better at memory than the others, and the same for the irregular reservoirs at prediction. Nonetheless, the difference between attractors is rather small, and it could be argued that is insignificant.</p>
<p>The picture is very different for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 (right column). Performances are distributed as clouds of points. In <xref ref-type="fig" rid="F5">Figure 5</xref>, we observe a large reservoir variability in both tasks. Some reservoirs are suitable for one task and bad for the other one. For intermediate and difficult tasks, some reservoirs outperform the best ones with &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0 in both memorization and prediction. Reservoirs at the critical point are found on the right of the plots, i.e. they promise good memorization but are nonetheless widely spread, especially in prediction (vertical axis). Overall, the distinct attractors occupy the space in overlapping and indistinguishable clouds; this confirms the previous analysis that attractors do not play a role in performance.</p></sec>
<sec>
<title>4.2.3. Discussion</title>
<p>Correlations in performances are very different for both signs of &#x003C3;<sup>&#x022C6;</sup>. Choosing a reservoir with &#x003C3;<sup>&#x022C6;</sup>&#x0007E;&#x02212;0.66 ensures a good, general-purpose reservoir but with suboptimal performance. In contrast, going into the positive side of &#x003C3;<sup>&#x022C6;</sup> may lead to the best reservoirs in a given task or even better general purpose reservoirs, but this comes at a price: those gems cannot be found by the statistical analysis we have performed on their free running activity.</p></sec></sec></sec>
<sec sec-type="conclusions" id="s5">
<title>5. Conclusion</title>
<p>One of the main issues in the field of RC is the lack of principled methodology (Rodan and Tino, <xref ref-type="bibr" rid="B41">2011</xref>) for reservoir design. This article aimed to quantify the impact of the random weight generation process to better understand the relationship between connectivity, dynamics, and performance. We demonstrated that the only control parameter is the ratio &#x003C3;<sup>&#x022C6;</sup> &#x0003D; &#x003C3;/&#x003BC; through a Gaussian weight distribution, which indirectly regulates the excitatory/inhibitory balance. We found two critical points and observed that reservoirs typically possess a dominant attractor, regardless of their initial states.</p>
<p>We investigated the relationship between the performance, the control parameter, and the preferred attractor in memory and prediction tasks. Our results reveal that &#x003C3;<sup>&#x022C6;</sup>, hence the excitatory-inhibitory balance <italic>b</italic>, has a strong impact on performance in the two considered tasks while the attractor dynamics have none. We showed how to select a control parameter region that ensures good performance, thus providing a very efficient way to obtain high-performance reservoirs. This region corresponds to high attractor diversity. For &#x003C3;<sup>&#x022C6;</sup> &#x0003C; 0, the critical region is narrower and does not necessarily coincide with the top of performance, while for &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0, the critical region corresponds to the performing region.</p>
<p>For the tasks, we showed that negative &#x003C3;<sup>&#x022C6;</sup> values produced superior results in prediction, with reliable performance and low reservoir-to-reservoir variability. Therefore, it is sufficient to perform free-running and pick a single value of &#x003C3;<sup>&#x022C6;</sup>, preferably close to the critical point <inline-formula><mml:math id="M33"><mml:msubsup><mml:mrow><mml:mi>&#x003C3;</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>. In contrast, positive &#x003C3;<sup>&#x022C6;</sup> values were found to have higher performance in memory tasks but with greater volatility. Since a given &#x003C3;<sup>&#x022C6;</sup> value can lead to diverse performance outcomes, generating random reservoirs and testing them during training to select the best performers is still necessary. Given enough trials, however, our findings suggest that &#x003C3;<sup>&#x022C6;</sup>&#x0003E; 0 can generate the bests general-purpose reservoirs.</p></sec>
<sec id="s6">
<title>6. Future work</title>
<p>We tested the impact of dynamics on performance in two types of tasks: memory and prediction, for various time series. It would be interesting to test if and how the balance and attractor dynamic impact other types of tasks and inputs, notably classification, as it is also a standard task in machine learning. Moreover, extending the cross-task performance analysis to classification could potentially reveal interesting insights about its performance.</p>
<p>Still, one surprising result is the limited impact of the intrinsic attractor dynamics on performance. One could test the robustness of this result by refining the attractor category, and future work may reveal greater performance sensitivity to attractor dynamics. For example, the extinguished category included all reservoirs with activities dying before 1, 000 time steps. Refining the analysis could involve correlating performance with the average time before free-running reservoir activity dies out. Similarly, cyclic reservoirs could be refined by analyzing their period (Kinoshita et al., <xref ref-type="bibr" rid="B23">2009</xref>), while some irregular activities may be considered cyclic when run for more extended periods. Moreover, it is possible that combining other types of analysis, such as correlation in space and time (Metzner and Krauss, <xref ref-type="bibr" rid="B38">2022</xref>), avalanche distribution size (Siddiqui et al., <xref ref-type="bibr" rid="B45">2018</xref>), basins of attraction (Del Giudice et al., <xref ref-type="bibr" rid="B14">1998</xref>; Chinarov and Menzinger, <xref ref-type="bibr" rid="B12">2000</xref>; Kinoshita et al., <xref ref-type="bibr" rid="B23">2009</xref>), the number of attractors (Cabessa and Villa, <xref ref-type="bibr" rid="B8">2018</xref>), and study of the reservoir topology (Kinoshita et al., <xref ref-type="bibr" rid="B23">2009</xref>; Masulli and Villa, <xref ref-type="bibr" rid="B36">2015</xref>), could provide better categorization of dynamics, with ultimately better predictive power of performance.</p>
<p>Finally, it would be of particular interest to see if our finding regarding the impact of the excitatory/inhibitory balance and dominant attractors also applies to other models, such as the quantum Ising spins, also used in the context of RC, which exhibit analogous phase transitions (Mart&#x000ED;nez-Pe&#x000F1;a et al., <xref ref-type="bibr" rid="B35">2021</xref>), and improved memory and prediction of time series in its vicinity (Kutvonen et al., <xref ref-type="bibr" rid="B29">2020</xref>).</p></sec>
<sec sec-type="data-availability" id="s7">
<title>Data availability statement</title>
<p>The original contributions presented in the study are publicly available. This data can be found here (Calvet, <xref ref-type="bibr" rid="B10">2023</xref>): <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.5281/zenodo.8121795">https://doi.org/10.5281/zenodo.8121795</ext-link>.</p></sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>EC conducted the research under the supervision of JR and BR. EC created the model, collected and analyzed the data, and wrote the manuscript. JR provided invaluable guidance and perspective throughout the process, along with BR, who also contributed to the writing and revision of the manuscript. All authors read and approved the final version of the article.</p></sec>
</body>
<back>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>This work was supported by the CRSNG/NSERC (Discovery Grant RGPIN-2017-06218), the Canada First Research Excellence Fund, and the QsciTech Program.</p>
</sec>
<ack><p>EC extends gratitude to Matin Azadmanesh, Lucas Herranz, and Ismael Balafrej for critical reading of the manuscript. The authors also express their appreciation to their colleagues at NECOTIS for their valuable feedback and insightful discussions throughout the research process. Finally, the authors thank the reviewers for their constructive comments that helped improve the quality of the manuscript.</p>
</ack>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<sec sec-type="supplementary-material" id="s11">
<title>Supplementary material</title>
<p>The Supplementary Material for this article can be found online at: <ext-link ext-link-type="uri" xlink:href="https://www.frontiersin.org/articles/10.3389/fncom.2023.1223258/full#supplementary-material">https://www.frontiersin.org/articles/10.3389/fncom.2023.1223258/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="Presentation_1.pdf" id="SM1" mimetype="application/pdf" xmlns:xlink="http://www.w3.org/1999/xlink"/></sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alexandre</surname> <given-names>L. A.</given-names></name> <name><surname>Embrechts</surname> <given-names>M. J.</given-names></name> <name><surname>Linton</surname> <given-names>J.</given-names></name></person-group> (<year>2009</year>). <article-title>&#x0201C;Benchmarking reservoir computing on time-independent classification tasks,&#x0201D;</article-title> in <source>Proceedings of the International Joint Conference on Neural Networks</source> 89&#x02013;93. <pub-id pub-id-type="doi">10.1109/IJCNN.2009.5178920</pub-id></citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Balafrej</surname> <given-names>I.</given-names></name> <name><surname>Alibart</surname> <given-names>F.</given-names></name> <name><surname>Rouat</surname> <given-names>J.</given-names></name></person-group> (<year>2022</year>). <article-title>P-CRITICAL: a reservoir autoregulation plasticity rule for neuromorphic hardware</article-title>. <source>Neuromor. Comput. Eng</source>. 2, 024007. <pub-id pub-id-type="doi">10.1088/2634-4386/ac6533</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Benjamin</surname> <given-names>B. V.</given-names></name> <name><surname>Gao</surname> <given-names>P.</given-names></name> <name><surname>McQuinn</surname> <given-names>E.</given-names></name> <name><surname>Choudhary</surname> <given-names>S.</given-names></name> <name><surname>Chandrasekaran</surname> <given-names>A. R.</given-names></name> <name><surname>Bussat</surname> <given-names>J.-M.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>Neurogrid: a mixed-analog-digital multichip system for large-scale neural simulations</article-title>. <source>Proc. IEEE</source> <volume>102</volume>, <fpage>699</fpage>&#x02013;<lpage>716</lpage>. <pub-id pub-id-type="doi">10.1109/JPROC.2014.2313565</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bertschinger</surname> <given-names>N.</given-names></name> <name><surname>Natschl&#x000E4;ger</surname> <given-names>T.</given-names></name></person-group> (<year>2004</year>). <article-title>Real-time computation at the edge of chaos in recurrent neural networks</article-title>. <source>Neur. Comput</source>. <volume>16</volume>, <fpage>1413</fpage>&#x02013;<lpage>1436</lpage>. <pub-id pub-id-type="doi">10.1162/089976604323057443</pub-id><pub-id pub-id-type="pmid">15165396</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bianchi</surname> <given-names>F. M.</given-names></name> <name><surname>Livi</surname> <given-names>L.</given-names></name> <name><surname>Alippi</surname> <given-names>C.</given-names></name></person-group> (<year>2016</year>). <article-title>Investigating echo state networks dynamics by means of recurrence analysis</article-title>. <source>IEEE Trans. Neur. Netw. Learn. Syst</source>. <volume>29</volume>, <fpage>427</fpage>&#x02013;<lpage>439</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2016.2630802</pub-id><pub-id pub-id-type="pmid">28114039</pub-id></citation></ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Burkow</surname> <given-names>A. V.</given-names></name> <name><surname>Tufte</surname> <given-names>G.</given-names></name></person-group> (<year>2016</year>). <source>Exploring physical reservoir computing using random boolean networks</source>. PhD thesis, Norwegian University of Science and Technology - NTNU.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>B&#x000FC;sing</surname> <given-names>L.</given-names></name> <name><surname>Schrauwen</surname> <given-names>B.</given-names></name> <name><surname>Legenstein</surname> <given-names>R.</given-names></name></person-group> (<year>2010</year>). <article-title>Connectivity, dynamics, and memory in reservoir computing with binary and analog neurons</article-title>. <source>Neur. Comput</source>. <volume>22</volume>, <fpage>1272</fpage>&#x02013;<lpage>1311</lpage>. <pub-id pub-id-type="doi">10.1162/neco.2009.01-09-947</pub-id><pub-id pub-id-type="pmid">20028227</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cabessa</surname> <given-names>J.</given-names></name> <name><surname>Villa</surname> <given-names>A. E.</given-names></name></person-group> (<year>2018</year>). <article-title>Attractor dynamics of a Boolean model of a brain circuit controlled by multiple parameters</article-title>. <source>Chaos</source> <volume>28</volume>, <fpage>106318</fpage>. <pub-id pub-id-type="doi">10.1063/1.5042312</pub-id><pub-id pub-id-type="pmid">30384642</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Callen</surname> <given-names>H. B.</given-names></name> <name><surname>Welton</surname> <given-names>T. A.</given-names></name></person-group> (<year>1951</year>). <article-title>Irreversibility and generalized noise</article-title>. <source>Phys. Rev</source>. <volume>83</volume>, <fpage>34</fpage>&#x02013;<lpage>40</lpage>. <pub-id pub-id-type="doi">10.1103/PhysRev.83.34</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Calvet</surname> <given-names>E.</given-names></name></person-group> (<year>2023</year>). <article-title>ManuNeuro/binary_model: First Release, Code release: V1.0.0</article-title>. <source>Zenodo</source>. <pub-id pub-id-type="doi">10.5281/zenodo.8121795</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Canaday</surname> <given-names>D.</given-names></name> <name><surname>Griffith</surname> <given-names>A.</given-names></name> <name><surname>Gauthier</surname> <given-names>D. J.</given-names></name></person-group> (<year>2018</year>). <article-title>Rapid time series prediction with a hardware-based reservoir computer</article-title>. <source>Chaos</source> <volume>28</volume>, <fpage>1</fpage>&#x02013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.1063/1.5048199</pub-id><pub-id pub-id-type="pmid">30599514</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chinarov</surname> <given-names>V.</given-names></name> <name><surname>Menzinger</surname> <given-names>M.</given-names></name></person-group> (<year>2000</year>). <article-title>Computational dynamics of gradient bistable networks</article-title>. <source>Biosystems</source> <volume>55</volume>, <fpage>137</fpage>&#x02013;<lpage>142</lpage>. <pub-id pub-id-type="doi">10.1016/S0303-2647(99)00091-X</pub-id><pub-id pub-id-type="pmid">10745117</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Croll</surname> <given-names>G. J.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x0201C;BiEntropy&#x02014;the Measurement and Algebras of Order and Disorder in Finite Binary Strings,&#x0201D;</article-title> in <source>Scientific Essays in Honor of H Pierre Noyes on the Occasion of His 90th Birthday</source> eds. J. C., Amson, and L. H., Kauffman (Singapore: Word Scientific) 48&#x02013;64. <pub-id pub-id-type="doi">10.1142/9789814579377_0004</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Del Giudice</surname> <given-names>P.</given-names></name> <name><surname>Fusi</surname> <given-names>S.</given-names></name> <name><surname>Badoni</surname> <given-names>D.</given-names></name> <name><surname>Dante</surname> <given-names>V.</given-names></name> <name><surname>Amit</surname> <given-names>D. J.</given-names></name></person-group> (<year>1998</year>). <article-title>Learning attractors in an asynchronous, stochastic electronic neural network</article-title>. <source>Network</source>. <volume>9</volume>, <fpage>183</fpage>&#x02013;<lpage>205</lpage>. <pub-id pub-id-type="doi">10.1088/0954-898X_9_2_003</pub-id><pub-id pub-id-type="pmid">9861985</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Del Papa</surname> <given-names>B.</given-names></name> <name><surname>Priesemann</surname> <given-names>V.</given-names></name> <name><surname>Triesch</surname> <given-names>J.</given-names></name></person-group> (<year>2017</year>). <article-title>Criticality meets learning: Criticality signatures in a self-organizing recurrent neural network</article-title>. <source>PLoS ONE</source> <volume>12</volume>, <fpage>1</fpage>&#x02013;<lpage>21</lpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0178683</pub-id><pub-id pub-id-type="pmid">28552964</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Echlin</surname> <given-names>M.</given-names></name> <name><surname>Aguilar</surname> <given-names>B.</given-names></name> <name><surname>Notarangelo</surname> <given-names>M.</given-names></name> <name><surname>Gibbs</surname> <given-names>D.</given-names></name> <name><surname>Shmulevich</surname> <given-names>I.</given-names></name></person-group> (<year>2018</year>). <article-title>Flexibility of boolean network reservoir computers in approximating arbitrary recursive and non-recursive binary filters</article-title>. <source>Entropy</source> <volume>20</volume>, <fpage>954</fpage>. <pub-id pub-id-type="doi">10.3390/e20120954</pub-id><pub-id pub-id-type="pmid">33266678</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goudarzi</surname> <given-names>A.</given-names></name> <name><surname>Marzen</surname> <given-names>S.</given-names></name> <name><surname>Banda</surname> <given-names>P.</given-names></name> <name><surname>Feldman</surname> <given-names>G.</given-names></name> <name><surname>Teuscher</surname> <given-names>C.</given-names></name> <name><surname>Stefanovic</surname> <given-names>D.</given-names></name></person-group> (<year>2016</year>). Memory and information processing in recurrent neural Networks. arXiv:1604.06929. <pub-id pub-id-type="doi">10.48550/arXiv.1604.06929</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hajnal</surname> <given-names>M. A.</given-names></name> <name><surname>L&#x000F6;rincz</surname> <given-names>A.</given-names></name></person-group> (<year>2006</year>). <article-title>&#x0201C;Critical echo state networks,&#x0201D;</article-title> in <source>Artificial Intelligence and Lecture Notes in Bioinformatics</source> 658&#x02013;667. <pub-id pub-id-type="doi">10.1007/11840817_69</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jaeger</surname> <given-names>H.</given-names></name></person-group> (<year>2001</year>). <source>The</source> &#x0201C;<italic>echo state</italic>&#x0201D; <italic>approach to analysing and training recurrent neural networks-with an erratum note&#x00027;</italic>.</citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jaeger</surname> <given-names>H.</given-names></name> <name><surname>Haas</surname> <given-names>H.</given-names></name></person-group> (<year>2004</year>). <article-title>Harnessing nonlinearity: predicting chaotic systems and saving energy in wireless communication</article-title>. <source>Science</source> <volume>304</volume>, <fpage>78</fpage>&#x02013;<lpage>80</lpage>. <pub-id pub-id-type="doi">10.1126/science.1091277</pub-id><pub-id pub-id-type="pmid">15064413</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karimipanah</surname> <given-names>Y.</given-names></name> <name><surname>Ma</surname> <given-names>Z.</given-names></name> <name><surname>Wessel</surname> <given-names>R.</given-names></name></person-group> (<year>2017</year>). <article-title>Criticality predicts maximum irregularity in recurrent networks of excitatory nodes</article-title>. <source>PLoS ONE</source> <volume>12</volume>, <fpage>e0182501</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0182501</pub-id><pub-id pub-id-type="pmid">28817580</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kingma</surname> <given-names>D. P.</given-names></name> <name><surname>Ba</surname> <given-names>J.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x0201C;Adam: a method for stochastic optimization,&#x0201D;</article-title> in <source>3rd International Conference for Learning Representations</source> (<publisher-loc>San Diego</publisher-loc>).</citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kinoshita</surname> <given-names>S.-I.</given-names></name> <name><surname>Iguchi</surname> <given-names>K.</given-names></name> <name><surname>Yamada</surname> <given-names>H. S.</given-names></name></person-group> (<year>2009</year>). <article-title>Intrinsic properties of Boolean dynamics in complex networks</article-title>. <source>J. Theor. Biol</source>. <volume>256</volume>, <fpage>351</fpage>&#x02013;<lpage>369</lpage>. <pub-id pub-id-type="doi">10.1016/j.jtbi.2008.10.014</pub-id><pub-id pub-id-type="pmid">19014957</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kinouchi</surname> <given-names>O.</given-names></name> <name><surname>Copelli</surname> <given-names>M.</given-names></name></person-group> (<year>2006</year>). <article-title>Optimal dynamical range of excitable networks at criticality</article-title>. <source>Nature Phys</source>. <volume>2</volume>, <fpage>348</fpage>&#x02013;<lpage>351</lpage>. <pub-id pub-id-type="doi">10.1038/nphys289</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Komkov</surname> <given-names>H.</given-names></name> <name><surname>Pocher</surname> <given-names>L.</given-names></name> <name><surname>Restelli</surname> <given-names>A.</given-names></name> <name><surname>Hunt</surname> <given-names>B.</given-names></name> <name><surname>Lathrop</surname> <given-names>D.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;RF signal classification using boolean reservoir computing on an FPGA,&#x0201D;</article-title> in <source>Proceedings of the International Joint Conference on Neural Networks</source>. <pub-id pub-id-type="doi">10.1109/IJCNN52387.2021.9533342</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Krauss</surname> <given-names>P.</given-names></name> <name><surname>Schuster</surname> <given-names>M.</given-names></name> <name><surname>Dietrich</surname> <given-names>V.</given-names></name> <name><surname>Schilling</surname> <given-names>A.</given-names></name> <name><surname>Schulze</surname> <given-names>H.</given-names></name> <name><surname>Metzner</surname> <given-names>C.</given-names></name></person-group> (<year>2019a</year>). <article-title>Weight statistics controls dynamics in recurrent neural networks</article-title>. <source>PLoS ONE</source> <volume>14</volume>, <fpage>e0214541</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0214541</pub-id><pub-id pub-id-type="pmid">30964879</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Krauss</surname> <given-names>P.</given-names></name> <name><surname>Zankl</surname> <given-names>A.</given-names></name> <name><surname>Schilling</surname> <given-names>A.</given-names></name> <name><surname>Schulze</surname> <given-names>H.</given-names></name> <name><surname>Metzner</surname> <given-names>C.</given-names></name></person-group> (<year>2019b</year>). <article-title>Analysis of structure and dynamics in three-neuron motifs</article-title>. <source>Front. Comput. Neurosci</source>. <volume>13</volume>, <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.3389/fncom.2019.00005</pub-id><pub-id pub-id-type="pmid">30792635</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ku&#x0015B;mierz</surname> <given-names>U.</given-names></name> <name><surname>Ogawa</surname> <given-names>S.</given-names></name> <name><surname>Toyoizumi</surname> <given-names>T.</given-names></name></person-group> (<year>2020</year>). <article-title>Edge of chaos and avalanches in neural networks with heavy-tailed synaptic weight distribution</article-title>. <source>Phys. Rev. Lett</source>. 125, 028101. <pub-id pub-id-type="doi">10.1103/PhysRevLett.125.028101</pub-id><pub-id pub-id-type="pmid">32701351</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kutvonen</surname> <given-names>A.</given-names></name> <name><surname>Fujii</surname> <given-names>K.</given-names></name> <name><surname>Sagawa</surname> <given-names>T.</given-names></name></person-group> (<year>2020</year>). <article-title>Optimizing a quantum reservoir computer for time series prediction</article-title>. <source>Scient. Rep</source>. <volume>10</volume>, <fpage>1</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1038/s41598-020-71673-9</pub-id><pub-id pub-id-type="pmid">32895412</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Landau</surname> <given-names>L. D.</given-names></name> <name><surname>Lifshitz</surname> <given-names>E. M.</given-names></name></person-group> (<year>1980</year>). <source>Statistical Physics, 3rd Edn. Elsevier</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.elsevier.com/books/statistical-physics/landau/978-0-08-057046-4">https://www.elsevier.com/books/statistical-physics/landau/978-0-08-057046-4</ext-link></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lavis</surname> <given-names>D. A.</given-names></name> <name><surname>K&#x000FC;hn</surname> <given-names>R.</given-names></name> <name><surname>Frigg</surname> <given-names>R.</given-names></name></person-group> (<year>2021</year>). <article-title>Becoming large, becoming infinite: the anatomy of thermal physics and phase transitions in finite systems</article-title>. <source>Found. Phys</source>. <volume>51</volume>, <fpage>1</fpage>&#x02013;<lpage>69</lpage>. <pub-id pub-id-type="doi">10.1007/s10701-021-00482-5</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lewin</surname> <given-names>R.</given-names></name> <name><surname>Bak</surname> <given-names>P.</given-names></name></person-group> (<year>1993</year>). <article-title>Complexity: life at the edge of chaos</article-title>. <source>Am. J. Phys</source>. <volume>61</volume>, <fpage>764</fpage>&#x02013;<lpage>765</lpage>. <pub-id pub-id-type="doi">10.1119/1.17163</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Maass</surname> <given-names>W.</given-names></name> <name><surname>Natschl&#x000E4;ger</surname> <given-names>T.</given-names></name> <name><surname>Markram</surname> <given-names>H.</given-names></name></person-group> (<year>2002</year>). <article-title>Real-time computing without stable states: a new framework for neural computation based on perturbations</article-title>. <source>NEURCOMP</source>. <volume>14</volume>, <fpage>2531</fpage>&#x02013;<lpage>2560</lpage>. <pub-id pub-id-type="doi">10.1162/089976602760407955</pub-id><pub-id pub-id-type="pmid">12433288</pub-id></citation></ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mamun</surname> <given-names>M. S. I.</given-names></name> <name><surname>Ghorbani</surname> <given-names>A. A.</given-names></name> <name><surname>Stakhanova</surname> <given-names>N.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;An entropy based encrypted traffic classifier,&#x0201D;</article-title> in <source>Information and Communications Security. ICICS 2015</source> 282&#x02013;294. <pub-id pub-id-type="doi">10.1007/978-3-319-29814-6_23</pub-id><pub-id pub-id-type="pmid">34770505</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mart&#x000ED;nez-Pe&#x000F1;a</surname> <given-names>R.</given-names></name> <name><surname>Giorgi</surname> <given-names>G. L.</given-names></name> <name><surname>Nokkala</surname> <given-names>J.</given-names></name> <name><surname>Soriano</surname> <given-names>M. C.</given-names></name> <name><surname>Zambrini</surname> <given-names>R.</given-names></name></person-group> (<year>2021</year>). <article-title>Dynamical phase transitions in quantum reservoir computing</article-title>. <source>Phys. Rev. Lett</source>. <volume>127</volume>, <fpage>1</fpage>&#x02013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1103/PhysRevLett.127.100502</pub-id><pub-id pub-id-type="pmid">34533342</pub-id></citation></ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Masulli</surname> <given-names>P.</given-names></name> <name><surname>Villa</surname> <given-names>A. E. P.</given-names></name></person-group> (<year>2015</year>). <article-title>The topology of the directed clique complex as a network invariant</article-title>. <source>SpringerPlus</source> <volume>5</volume>, <fpage>388</fpage>. <pub-id pub-id-type="doi">10.1186/s40064-016-2022-y</pub-id><pub-id pub-id-type="pmid">27047714</pub-id></citation></ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Merolla</surname> <given-names>P. A.</given-names></name> <name><surname>Arthur</surname> <given-names>J. V.</given-names></name> <name><surname>Alvarez-Icaza</surname> <given-names>R.</given-names></name> <name><surname>Cassidy</surname> <given-names>A. S.</given-names></name> <name><surname>Sawada</surname> <given-names>J.</given-names></name> <name><surname>Akopyan</surname> <given-names>F.</given-names></name> <etal/></person-group>. (<year>2014</year>). <article-title>A million spiking-neuron integrated circuit with a scalable communication network and interface</article-title>. <source>Science</source> <volume>345</volume>, <fpage>668</fpage>&#x02013;<lpage>673</lpage>. <pub-id pub-id-type="doi">10.1126/science.1254642</pub-id><pub-id pub-id-type="pmid">25104385</pub-id></citation></ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Metzner</surname> <given-names>C.</given-names></name> <name><surname>Krauss</surname> <given-names>P.</given-names></name></person-group> (<year>2022</year>). <article-title>Dynamics and information import in recurrent neural networks</article-title>. <source>Front. Comput. Neurosci</source>. <volume>16</volume>, <fpage>1</fpage>&#x02013;<lpage>15</lpage>. <pub-id pub-id-type="doi">10.3389/fncom.2022.876315</pub-id><pub-id pub-id-type="pmid">35573264</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Natschl&#x000E4;ger</surname> <given-names>T.</given-names></name> <name><surname>Bertschinger</surname> <given-names>N.</given-names></name> <name><surname>Legenstein</surname> <given-names>R.</given-names></name></person-group> (<year>2005</year>). <article-title>&#x0201C;At the edge of chaos: Real-time computations and self-organized criticality in recurrent neural networks,&#x0201D;</article-title> in <source>Advances in Neural Information Processing Systems</source> 17.</citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Oztuik</surname> <given-names>M. C.</given-names></name> <name><surname>Xu</surname> <given-names>D.</given-names></name> <name><surname>Principe</surname> <given-names>J. C.</given-names></name></person-group> (<year>2007</year>). <article-title>Analysis and design of echo state networks</article-title>. <source>Neur. Comput</source>. <volume>19</volume>, <fpage>111</fpage>&#x02013;<lpage>138</lpage>. <pub-id pub-id-type="doi">10.1162/neco.2007.19.1.111</pub-id><pub-id pub-id-type="pmid">17134319</pub-id></citation></ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rodan</surname> <given-names>A.</given-names></name> <name><surname>Tino</surname> <given-names>P.</given-names></name></person-group> (<year>2011</year>). <article-title>Minimum Complexity Echo State Network</article-title>. <source>IEEE Trans. Neur. Netw</source>. <volume>22</volume>, <fpage>131</fpage>&#x02013;<lpage>144</lpage>. <pub-id pub-id-type="doi">10.1109/TNN.2010.2089641</pub-id><pub-id pub-id-type="pmid">21075721</pub-id></citation></ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rosin</surname> <given-names>D. P.</given-names></name></person-group> (<year>2015</year>). <source>Dynamics of Complex Autonomous Boolean Networks</source>. Springer Theses. Springer International Publishing, Cham. <pub-id pub-id-type="doi">10.1007/978-3-319-13578-6</pub-id></citation>
</ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schrauwen</surname> <given-names>B.</given-names></name> <name><surname>Verstraeten</surname> <given-names>D.</given-names></name> <name><surname>Van Campenhout</surname> <given-names>J.</given-names></name></person-group> (<year>2007</year>). <article-title>&#x0201C;An overview of reservoir computing: Theory, applications and implementations,&#x0201D;</article-title> in <source>ESANN 2007 Proceedings</source> - <italic>15th European Symposium on Artificial Neural Networks</italic> 471&#x02013;482. <pub-id pub-id-type="doi">10.1007/978-3-540-74690-4_48</pub-id></citation>
</ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Seifter</surname> <given-names>J.</given-names></name> <name><surname>Reggia</surname> <given-names>J. A.</given-names></name></person-group> (<year>2015</year>). <article-title>Lambda and the edge of chaos in recurrent neural networks</article-title>. <source>Artif. Life</source> <volume>21</volume>, <fpage>55</fpage>&#x02013;<lpage>71</lpage>. <pub-id pub-id-type="doi">10.1162/ARTL_a_00152</pub-id><pub-id pub-id-type="pmid">25514434</pub-id></citation></ref>
<ref id="B45">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siddiqui</surname> <given-names>M.</given-names></name> <name><surname>Wedemann</surname> <given-names>R. S.</given-names></name> <name><surname>Jensen</surname> <given-names>H. J.</given-names></name></person-group> (<year>2018</year>). <article-title>Avalanches and generalized memory associativity in a network model for conscious and unconscious mental functioning</article-title>. <source>Phys. A. Stat. Mech. Applic</source>. <volume>490</volume>, <fpage>127</fpage>&#x02013;<lpage>138</lpage>. <pub-id pub-id-type="doi">10.1016/j.physa.2017.08.011</pub-id></citation>
</ref>
<ref id="B46">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Snyder</surname> <given-names>D.</given-names></name> <name><surname>Goudarzi</surname> <given-names>A.</given-names></name> <name><surname>Teuscher</surname> <given-names>C.</given-names></name></person-group> (<year>2012</year>). <article-title>Computational capabilities of random automata networks for reservoir computing</article-title>. <source>Phys. Rev. E</source>. <volume>87</volume>, <fpage>1</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.87.042808</pub-id><pub-id pub-id-type="pmid">23679474</pub-id></citation></ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tanaka</surname> <given-names>G.</given-names></name> <name><surname>Yamane</surname> <given-names>T.</given-names></name> <name><surname>H&#x000E9;roux</surname> <given-names>J. B.</given-names></name> <name><surname>Nakane</surname> <given-names>R.</given-names></name> <name><surname>Kanazawa</surname> <given-names>N.</given-names></name> <name><surname>Takeda</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Recent advances in physical reservoir computing: a review</article-title>. <source>Neur. Netw</source>. <volume>115</volume>, <fpage>100</fpage>&#x02013;<lpage>123</lpage>. <pub-id pub-id-type="doi">10.1016/j.neunet.2019.03.005</pub-id><pub-id pub-id-type="pmid">30981085</pub-id></citation></ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tieck</surname> <given-names>J. C. V.</given-names></name> <name><surname>Pogan&#x0010D;i&#x00107;</surname> <given-names>M. V.</given-names></name> <name><surname>Kaiser</surname> <given-names>J.</given-names></name> <name><surname>Roennau</surname> <given-names>A.</given-names></name> <name><surname>Gewaltig</surname> <given-names>M.-O.</given-names></name> <name><surname>Dillmann</surname> <given-names>R.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Learning continuous muscle control for a multi-joint arm by extending proximal policy optimization with a liquid state machine,&#x0201D;</article-title> in <source>Artificial Neural Networks and Machine Learning&#x02014;ICANN 2018</source> eds. V., Ku&#x000B0;rkov&#x000E1;, Y., Manolopoulos, B., Hammer, L., Iliadis, I., Maglogiannis (Cham: Springer) 211&#x02013;221. <pub-id pub-id-type="doi">10.1007/978-3-030-01418-6_21</pub-id></citation>
</ref>
<ref id="B49">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>J.</given-names></name> <name><surname>Zeng</surname> <given-names>X.</given-names></name></person-group> (<year>2022</year>). <article-title>&#x0201C;Physical layer secret key generation for spatially correlated channels based on multi-task autoencoder,&#x0201D;</article-title> in <source>2022 7th International Conference on Intelligent Computing and Signal Processing, ICSP 2022</source> 144&#x02013;150. <pub-id pub-id-type="doi">10.1109/ICSP54964.2022.9778422</pub-id></citation>
</ref>
</ref-list>
</back>
</article>