A mathematical analysis of the effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks
Benoit Siri (INRIA Futurs), Hugues Berry (INRIA Futurs), Bruno Cessac, (INLN), Bruno Delord (ANIM), Mathias Quoy (ETIS)

TL;DR
This paper provides a mathematical framework to understand how Hebbian learning influences the dynamics and structure of discrete-time random recurrent neural networks, revealing conditions for stability and sensitivity to learned patterns.
Contribution
It offers a novel mathematical analysis of Hebbian learning effects, incorporating passive forgetting and multiple time scales, linking neuronal dynamics with network structure through Jacobian matrices.
Findings
Hebbian learning can transition networks from chaos to steady states via bifurcations.
Sensitivity to learned patterns peaks when the largest Lyapunov exponent approaches zero.
The analysis connects network stability with the spectral properties of Jacobian matrices.
Abstract
We present a mathematical analysis of the effects of Hebbian learning in random recurrent neural networks, with a generic Hebbian learning rule including passive forgetting and different time scales for neuronal activity and learning dynamics. Previous numerical works have reported that Hebbian learning drives the system from chaos to a steady state through a sequence of bifurcations. Here, we interpret these results mathematically and show that these effects, involving a complex coupling between neuronal dynamics and synaptic graph structure, can be analyzed using Jacobian matrices, which introduce both a structural and a dynamical point of view on the neural network evolution. Furthermore, we show that the sensitivity to a learned pattern is maximal when the largest Lyapunov exponent is close to 0. We discuss how neural networks may take advantage of this regime of high functional…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural dynamics and brain function · Neural Networks and Applications · stochastic dynamics and bifurcation
A mathematical analysis of the effects of
Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks
Benoît Siri
Hugues Berry
Team Alchemy, INRIA, Parc Club Orsay Université, 4 rue J Monod, 91893 Orsay Cedex - France
Bruno Cessac
Team Odyssee, INRIA, 2004 Route des Lucioles, 06902 Sophia Antipolis, France
Université de Nice, Parc Valrose, 06000 Nice, France
Institut Non Linéaire de Nice, UMR 6618 CNRS, 1361 route des Lucioles, 06560 Valbonne, France
Bruno Delord
ANIM, U742 INSERM - Université P.M. Curie, 9 quai Saint-Bernard, 75005 Paris, France
Mathias Quoy
ETIS, UMR 8051 CNRS-Université de Cergy-Pontoise-ENSEA, 6 avenue du Ponceau, BP 44, 95014 Cergy-Pontoise Cedex, France
Abstract
We present a mathematical analysis of the effects of Hebbian learning in random recurrent neural networks, with a generic Hebbian learning rule including passive forgetting and different time scales for neuronal activity and learning dynamics. Previous numerical works have reported that Hebbian learning drives the system from chaos to a steady state through a sequence of bifurcations. Here, we interpret these results mathematically and show that these effects, involving a complex coupling between neuronal dynamics and synaptic graph structure, can be analyzed using Jacobian matrices, which introduce both a structural and a dynamical point of view on the neural network evolution. Furthermore, we show that the sensitivity to a learned pattern is maximal when the largest Lyapunov exponent is close to 0. We discuss how neural networks may take advantage of this regime of high functional interest.
I Introduction
The mathematical study of the effects of synaptic plasticity (or more generally learning) in neural networks is a difficult task because the dynamics of the neurons depends on the synaptic weights network, that itself evolves non trivially under the influence of neuron dynamics. Understanding this mutual coupling (and its effects on the computational efficiency of the neural network) is a key problem in computational neuroscience and necessitates new analytical approaches.
In recent years, the related field of dynamical systems interacting on complex networks has attracted vast interest. Most studies have focused on the influence of network structure on the global dynamics (for a review, see Boccaletti et al. (2006)). In particular, much effort has been devoted to the relationships between node synchronization and the classical statistical quantifiers of complex networks (degree distribution, average clustering index, mean shortest path, motifs, modularity…) Grinstein and Linsker (2005); Nishikawa et al. (2003); Lago-Fernández et al. (200). The core idea was that the impact of network topology on global dynamics might be prominent, so that these structural statistics may be good indicators of global dynamics. This assumption proved however largely wrong and some of the related studies yielded contradictory results Nishikawa et al. (2003); Hong et al. (2002). Actually, synchronization properties cannot be systematically deduced from topology statistics but may be inferred from the spectrum of the network Atay et al. (2006). Most of these studies have considered diffusive coupling between the nodes Hasegawa (2005). In this case, the adjacency matrix has real nonnegative eigenvalues, and global properties, such as stability of the synchronized states Barahona and Pecora (2002) can easily be inferred from its spectral properties (see also Atay. et al. (2006); Volchenkov and Blanchard (2007) and Chung (1997) for a review on mathematically rigorous results). Unfortunately, the coupling between neurons (synaptic weights) in neural networks is rarely diffusive, the corresponding matrix is not symmetric and may contain positive and negative elements. In addition, the synaptic graph structure of a neural network is usually not fixed but evolves with time, which adds another level of complexity. Hence, these results are not directly applicable to neural networks.
Discrete-time random recurrent neural networks (RRNNs) are known to display a rich variety of dynamical behaviors, including fixed points, limit cycle oscillations, quasi periodicity and deterministic chaos Doyon et al. (1993). The effect of hebbian learning in RRNN, including pattern retrieval properties, has been explored numerically by Daucé and some of us Dauce et al. (1998). It was observed that Hebbian learning leads to a systematic reduction of the dynamics complexity (transition from chaos to fixed point by an inverse quasi-periodicity route). This property has been exploited for pattern retrieval. After a suitable learning phase the presentation of a learned pattern induces a bifurcation (e.g. from chaos to a simpler attractor such as a limit cycle). This effect is inherited via learning (it does not exist before learning), is robust to a small amount of noise, and selective (it does not occur for drastically different patterns). These effects were however neither analyzed nor really understood in Dauce et al. (1998). This work was extended to sequence learning and expoited on a robotic platform in Daucé et al. (2002).
More recently, Echo State Networks (ESN) Jaeger and Haas (2004) have been developed, where, as in our case, the network acts as a reservoir of resonant frequencies. However, learning only affects output links in ESN networks, while the weights within the reservoir are kept constant. Tsuda’s chaotic itinerancy is an alternative way for linking different attractors with different inputs Tsuda (2001). In this model, weights are initially fixed in a Hopfield-like manner (and are thus symmetric) and a chaotic dynamics successively explores the different fixed point attractors. In this scheme, each input constitutes an different initial condition that leads to one attractor of the same dynamical system, whereas in Dauce et al. (1998), each (time-constant) input leads to a different dynamical system.
In the current state of the art, there is a relatively large number of models, observations and applications of Hebbian learning effects in neural networks, but considerably less mathematical results. Mathematical analysis is however necessary to classify the many variants of Hebbian learning rules according to the effects they produce. The present paper is one step further towards this aim. Using methods from dynamical systems theory, we analyze the effects of a generic version of Hebbian learning proposed in Hoppensteadt and Izhikevich (1997) on the neural network model numerically studied in Dauce et al. (1998) with spontaneous (i.e. before learning) chaotic dynamics.
We essentially classify the effects into three families:
(i) Topological: the structure of the synaptic weight network evolves, implying prominent (e.g. cooperative) effects on the dynamics.
(ii) Dynamical: the dynamical complexity (measured e.g. by the maximal Lyapunov exponent or the Kolmogorov-Sinai entropy) reduces during Hebbian learning. This effect is mathematically analyzed and interpreted. Especially, we provide a rigorous upper bound on the maximal Lyapunov exponent and identify two major causes for this reduction: the decay of the norm of the synaptic weight matrix and the saturation of neurons.
(iii) Functional: Focusing on the network response to a learned pattern, we show that there is a learning stage at which the response is maximal, in the sense that it generates a drastic change of the neuronal dynamics (i.e. a bifurcation). This stage precisely corresponds to vanishing of the maximal Lyapunov exponent.
Some of these results may appear neither “new” nor “surprising” for the neural networks community. For example, (ii) and (iii) have already been reported in Dauce et al. (1998). However, the results were mainly numerical while the present paper proposes a mathematical framework and formal tools to analyze them. Moreover, a direct consequence of (iii) is that the response of the neural network to a learned pattern is maximal at the “edge of chaos” (where the maximal Lyapunov exponent vanishes).
The claim that the neural network response is maximal close to a bifurcation is common in the neural network community Langton (1990). Similarly, Hoppensteadt and Izhikevich (1997) already pointed out the necessity for some neurons to lie close to a bifurcation point in order to have relevant computational capacities. As a matter of fact, an analysis of the effects of a Hopfield-Hebb rule was performed in this book with neurons close to codimension one fixed-point bifurcations.
We go a step further in the present paper and show that a similar conclusion holds for a neural network in a chaotic regime. Conceptually, the analysis of Hoppensteadt and Izhikevich (1997) could be extended to chaotic systems 111A cornerstone of the analysis in Hoppensteadt and Izhikevich (1997) is the use of Hartman-Grobman theorem, and its consequence, namely that neural networks have non trivial properties only if some neurons are close to a bifurcation point. In some sense, this analysis can be extended to uniformly hyperbolic dynamical systems, a small subset of chaotic systems (though it has never been done). In addition, it is absolutely not guaranteed that chaotic RRNNs are uniformly hyperbolic, since one does not control the spectrum of the Jacobian matrices. The main difficulty is to characterize this spectrum on the -limit set (and not in the whole phase space). As a matter of fact, we do not know of any mathematical result with regard to this aspect. Cessac and Samuelides (2007). However, the analytic treatment of the chaotic case is really challenging. Hence, bifurcation analysis of fixed points (or periodic orbits) uses a linear analysis via Jacobian matrices, which is usually considered non-applicable to chaotic systems where nonlinear effects and initial conditions sensitivity are prominent. Nevertheless, recent results by Ruelle Ruelle (1999) on linear response theory, formally extended to chaotic neural networks Cessac and Sepulchre (2006, 2007), show that a linear analysis is indeed possible if one uses an average of the Jacobian matrix along its chaotic trajectory. The associated linear response operator provides a deep insight into the links between topology and dynamics in chaotic neural networks. Incidentally, it shows that the relevant matrix is not the weight matrix (as would be expected), but the linear response matrix, which reduces, in the present context, to the ergodic average of the Jacobian matrix along its trajectory 222This result, which may a posteriori appear obvious to readers familiar with dynamical systems theory is in fact highly non trivial and requires Ruelle’s linear response theory to be properly justified..
Though the main results in this paper are mathematical, we also use some numerical simulations. They were necessary because mathematical results are obtained using a limit where time goes to infinity, which is not operational in numerical situations. Moreover, the central rigorous results we obtain provide upper bounds, whose quality had to be checked numerically.
The paper is organized as follows. We first present the model and the generic framework for neuronal dynamics and learning rules in section II. The following sections are devoted to the analysis of the model. In section III, we present analytical results explaining the evolution of dynamics during learning using mathematical tools from dynamical systems and graph theory. These analytical results are confirmed by extensive numerical simulations. Section IV focuses on functional effects related to network sensitivity to the learned pattern. We finally discuss our results in the last section (V).
II General framework
II.1 Model description
We consider firing-rate recurrent neural networks with point neurons and discrete-time dynamics, where learning may occur on a different (slower) time scale than neuron dynamics. Synaptic weights are thus constant for consecutive dynamics steps, which defines a “learning epoch”. The weights are then updated and a new learning epoch begins. We denote by the update index of neuron states (neuron dynamics) inside a learning epoch, while indicates the update index of synaptic weights (learning dynamics). Call the mean firing rate of neuron , at time within the learning epoch . Set . Denote by F the function such that where is a sigmoidal transfer function (e.g. ). Let be the matrix of synaptic weights at the -th learning epoch. Then the discrete time neuron dynamics writes:
[TABLE]
is called “the local field (or the synaptic potential), at neuron time and learning epoch ”. The output gain tunes the nonlinearity of the function and mimics the reactivity of the neuron. The vector \mbox{\boldmath\xi}=\left(\xi_{i}\right)_{i=1}^{N} is the “pattern” to be learned. The initial weight matrix is randomly and independently sampled from a Gaussian law with mean [math] and variance . Hence, the synaptic weights matrix typically contains positive (excitation), negative (inhibition) or null (no synapse) elements and is asymmetric ().
The network can display different dynamical regimes (chaos, (quasi-) periodicity, fixed point), depending on these parameters Dauce et al. (1998). In the present study, the parameters were set so that the spontaneous dynamics (i.e. the network dynamics at ) was chaotic. At the end of every learning epoch, the neuron dynamics indices are reset, and .
The learning rules we study conform to Hebb’s postulate Hebb (1948). Specifically, we define the following generic formulation Hoppensteadt and Izhikevich (1997):
[TABLE]
where is the learning rate and a Hebbian function (see below). The first term in the right-hand side (RHS) member accounts for passive forgetting, i.e. is the forgetting rate. If and (i.e. both pre- and postsynaptic neurons are silent, see below), eq. (2) leads to an exponential decay of the synaptic weights (hence passive forgetting), with a characteristic rate (see discussion, section V). Note that there is no forgetting when . The second term in the RHS member generically accounts for activity-dependent plasticity, i.e. the effects of the pre- and postsynaptic neuron firing rates. We focus here on learning rules where this term depends on the history of activities333 As a matter of fact, note that is a function of the trajectories , which depend on , which in turn depends on … Hence, the set of synaptic weights at time and the dynamics of the corresponding neurons are functions of the whole history of the system. In this respect, we address a very untypical and complex type of dynamical systems where the flow at time is a function of the past trajectory and not only a function of the previous state. (In the context of stochastic processes, such systems are called “chains with complete connections” by opposition to (generalized) Markov processes). This induces rich properties such as a wide learning-induced variability in the network response to a given stimulus, with the same set of initial synaptic weights, simply by changing the initial conditions., i.e.
[TABLE]
where is the trajectory of neuron firing rate. In the present paper, as a simple example, we shall associate to the history of neuron rate an activity index :
[TABLE]
where is a threshold and is a function of and .
The neuron is considered active during learning epoch whenever , and silent otherwise. does not need to be explicitly defined in the mathematical study. In numerical simulations however, we set it to . Definition (4) actually encompasses several cases. If , weight changes depend only on the instantaneous firing rates, while if , weight changes depend on the mean value of the firing rate, averaged over a time window of duration in the learning epoch. In many aspects the former case can be considered as plasticity, while the latter may be related to meta-plasticity Abraham and Bear (1996). In this paper, we set for the mathematical analysis. We chose a value of in numerical simulations, which corresponds to the time scale ratio between neuronal dynamics (ms) and synaptic plasticity (10 s) (see Delord et al. (2007)). Importantly, note that other values of (including ) have been tested in simulations and did not lead to any qualitative change in the network behavior, although some integration lag effects were observed for very small values. Therefore, the exact value of has no impact on the major conclusions of the present paper.
The explicit definition of the function in eq.(3) is constrained by Hebb’s postulate for plasticity. This postulate is somewhat loosely defined, so that many implementations are possible in our framework. Our choice is guided by the following points Hoppensteadt and Izhikevich (1997):
whenever post-synaptic () and pre-synaptic () neurons are active, as in long-term potentiation (LTP). 2. 2.
whenever is inactive and is active, corresponding to homosynaptic long-term depression (LTD). 3. 3.
whenever is inactive. This point is often considered as a corollary to Hebb’s rule Hoppensteadt and Izhikevich (1997). Moreover, it renders the learning rule asymmetric and excludes the possibility that dynamics changes induced by learning could be due to weight symmetrization. This hypothesis however formally excludes heterosynaptic LTD Bear and Abraham (1996), which would correspond to for active and inactive. However, most of the results presented herein remain valid in the presence of heterosynaptic LTD (see section V for a discussion).
Although these settings are sufficient for mathematical analysis, has to be more precisely defined for numerical simulations. Hence, for the simulations, we set an explicit implementation of such that :
[TABLE]
where , is the Heaviside function, , is the vector of components and denotes the transpose. Finally, in the simulations, we forbid weights to change their sign, and self-connections stay to [math] (note however that these settings do not influence qualitatively the results presented here).
For the purpose of the present paper, the exact value of this input pattern is not very important, as soon as its maximal amplitude remains small with respect to the neuron maximal firing rate. Here, we used in all numerical simulations. The main rationale for this choice is that this pattern is easily identified by eyes when the s are plotted against , which is particularly helpful when interpreting alignment results, such as in fig. 3.
Equations (1) & (5) define a dynamical system where two distinct processes (neuron dynamics and synaptic network evolution) interact with distinct time scales. This results in a complex interwoven evolution where neuronal dynamics depends on the synaptic structure and synapses evolve according to neuron activity. On general grounds, this process has a memory that is a priori infinite and the state of the neural network depends on the past history.
II.2 Analysis tools
One possible approach to topology and dynamics interactions in neural networks consists in searching structural cues in the synaptic weight matrix that may be informative of specific dynamical regimes. The weight matrix is expected to carry information about the functional network. However, it can be easily shown that the synaptic weight matrix is not sufficient to analyze the relationship between topology and dynamics in neural networks such as (1).
A standard procedure for the analysis of nonlinear dynamical systems starts with a linear analysis. This holds e.g. for stability and bifurcation analysis but also for the computation of indicators such as Lyapunov exponents. The key object for this analysis is the Jacobian matrix. In our case, it writes:
[TABLE]
with:
[TABLE]
Interestingly enough, the Jacobian matrix generates a graph structure that can be interpreted in causal terms (see Appendix F for more details). Applying a small perturbation to , the induced variation on is given, to the linear order, by . Therefore, the induced effect, on neuron , of a small variation in the state of neuron is not only proportional to the synaptic weight , it also depends on the state of neuron via . For example, if is very large (neuron “saturation”), is very close to [math] and the perturbation on any has no effect on .
From this very simple argument we come to the conclusion that the Jacobian matrix displays more information than the synaptic weight matrix:
The “causal” graph induced by the Jacobian matrix leads to the notion of cooperative systems, introduced by Hirsch in Hirsch (1989) and widely studied in the field of genetic networks Thomas (1981); Gouzé (1998). This notion is also useful in the present context (see appendix F). 2. 2.
The Jacobian matrix allows to perform local bifurcation analysis. In our case, this provides information about the effect of pattern presentation before and after learning (section IV). 3. 3.
The Jacobian matrix allows to define Lyapunov exponents, which are used to measure the degree of chaos in a dynamical system. 4. 4.
The Jacobian matrix allows to define the notion of linear response in chaotic systems Ruelle (1999); Cessac and Sepulchre (2006, 2007), which extends the notion of causal graph to nonlinear systems with chaotic dynamics (see in section IV).
III Dynamical viewpoint
As explained in the introduction and reported in Dauce et al. (1998), Hebbian learning rules can lead to reduction of the dynamics complexity from chaos to quasiperiodic attractor, limit cycle and fixed point, due to the mutual coupling between weights evolution and neuron dynamics. The aim of this section is to provide a theoretical interpretation of this reduction of complexity for a more general class of Hebbian learning rules than those considered in Dauce et al. (1998).
III.1 Entropy reduction.
III.1.1 Evolution of the weight matrix.
From eq. (2) it is easy to show by recurrence that:
[TABLE]
The evolution of the weight matrix under the influence of the generic learning rule eq.(2) originates from two additive contributions. If , the “direct” contribution of to (the first term in the RHS member) decays exponentially fast. Hence the effect of is that the initial synaptic structure is progressively forgotten, offering the possibility to entirely “rewire” the network in a time scale proportional to . The second RHS term of eq. (8) corresponds to the new synaptic structure emerging with learning and replacing the initial one (which fades away exponentially fast). Importantly, this second term includes contributions from each previous matrices (with an exponentially decreasing contribution ). Hence, the emerging weights structure depends on the whole history of the neuronal dynamics.
If , one expects to reach a stationary regime where synaptic weights do not evolve anymore: both matrices and are expected to stabilize at long learning epochs to constant values ( and ). This means that, if , the dynamics settle at long learning epochs onto a stable attractor that is not modified by further learning of a given stimulus. The existence of such a stationary distribution is provided by the sufficient condition:
[TABLE]
We show in appendix B that, assuming moderate hypotheses on (eq. 3), can be upper-bounded, , by a constant , so that . From eq.(8), an upper bound for the norm of is trivially found:
[TABLE]
where is the operator norm (induced e.g. by Euclidean norm). Hence,
[TABLE]
This result shows that the major effect of the Hebbian learning rule we study may consist in an exponentially fast contraction of the norm of the weight matrix, which is due to the term , i.e. to passive forgetting (). Note also that if , this term may diverge, leading to a divergence of . Therefore, in this case, one has to add an artificial cut-off to avoid this unphysical divergence.
These analytical results need not to be “confirmed” by numerical simulations, as they are rigorous. However, they only provide an upper bound that can be rough, while simulations allows to evaluate how far from the exact values these bounds are.
Let be the eigenvalues of , ordered such that . Since , the spectral radius of , is smaller than one has from eq.(11):
[TABLE]
This equation predicts a bound on the spectral radius that contracts exponentially fast with time, under the control of the forgetting rate . Figure 1 shows the evolution of the spectral radius of for different values of during numerical simulations (open symbols). The results show that the spectral radius indeed decays exponentially fast. Moreover, we also plot on this figure (full lines) exponential decays according to the first RHS member of eq.(12), i.e. . The almost perfect agreement with the measurements tells us that the bound obtained in eq.(12) actually represents a very good estimate of the value of .
III.1.2 Jacobian matrices.
Let . A bound for the spectral radius of can easily be derived from 11 and 6. Call the eigenvalues of ordered such that . One has, :
[TABLE]
Since ( is diagonal and ), one finally gets
[TABLE]
Therefore, we obtain a bound on the spectrum of that can be contracted by two effects: the contraction of the spectrum of and/or the decay of related to the saturation of neuronal activity. Indeed, is small if is saturated to [math] or (i.e. is large), but large whenever is intermediate, i.e. falls into the central, pseudo-linear part of the sigmoid . We have already evidenced above that yields to a decrease of . Note that even if (no passive forgetting) and diverges, then diverges as well, leading to vanish, thus decreasing the spectral radius of the Jacobian matrix. Hence, if the initial value of is larger than and the bound in eq.(14) represents an accurate estimate of , eq.(14) predicts that the latter may decrease down to a value . We are dealing here with discrete time dynamical systems, so that the value locates a bifurcation of the dynamical system. Hence, eq.(14) opens up the possibility that learning drives the system through bifurcations. Again, simulations (fig. 4) show that the bound obtained in eq. 14 is indeed very close to the actual value of the Jacobian matrix spectral radius. As will be shown later (section IV), this point is of great importance from a functional viewpoint.
III.1.3 A bound on the maximal Lyapunov exponent.
Eq. (14) depends on x and cannot provide information on the typical behavior of the dynamical system. This information is provided by the computation of the largest Lyapunov exponent (see appendix A for definitions). In the present setting, the largest Lyapunov exponent, depends on the learning epoch . It can be computed exactly before learning in the thermodynamic limit , because ’s are i.i.d. random variables Cessac (1995) and it can be showed that it is positive provided is sufficiently large444In the limit and for random i.i.d. weights with 0 mean and variance , converges almost surely to a value proportional to , the proportionality factor depending on the explicit form of Girko (1984); Cessac (1994). However, because the weights deviate from i.i.d. random distribution under the influence of Hebbian learning, the evolution of cannot be computed analytically as soon as . Nevertheless, the following theorem (proven in appendix C) yields a useful upper-bound of :
Theorem 1
[TABLE]
where denotes the time average of , in the learning epoch (see appendix for details).
This theorem emphasizes the two main effects that may contribute to a decrease of . The first term in the RHS member states that the upper bound on decreases if the norm of the weights matrix decreases during learning. The second term is related to the saturation of neurons. However, the main difference with eq. (14) is that we now have an information on how saturation effects act on average on dynamics, via . The second term in the RHS member is positive if some neurons have an average larger than (that is, they are mainly dominated by amplification effects corresponding to the central part of the sigmoid) and becomes negative when all neurons are saturated on average.
In any case, it follows that if learning increases the saturation level of neurons or decreases the norm of the weights matrix , then the result can be a decay of (if the bound is a good estimate), thus a possible transition from chaotic to simpler attractors. A canonical measure of dynamical complexity is the Kolmogorov-Sinai (KS) entropy which is bounded from above by the sum of positive Lyapunov exponents. Therefore, if the largest Lyapunov exponent decreases, KS entropy and the dynamical complexity decrease.
On numerical grounds we observe the following. Fig. 2A shows measurements of during numerical simulations with different values of the passive forgetting rate . Its initial value is positive because we start our simulations with chaotic networks (). The Hebbian learning rule eq.(5) indeed leads to a rapid decay of , whose rate depends on . Hence shifts quickly to negative values, confirming the decrease of the dynamical complexity that could be inferred from visual inspection of temporal traces of the network averaged activity (fig. 2B).
To conclude, our mathematical framework indicates a systematic decay of induced by passive forgetting and/or increased neuronal saturation. This decay explains the decreasing dynamical complexity from chaos to steady state that is observed numerically.
III.2 Neuron activity.
We now present analytical results concerning the evolution of individual neuron activity. Application of the learning rule eq.(2) changes the structure of the attractor from one learning epoch to the other. The magnitude of this change can be measured by changes in the average value of some relevant observable such as neuron activity (more generally, learning induces a variation in the SRB measure , see appendix A). Let be the variation of the average activity x between learning epoch and . By definition (see appendix A):
[TABLE]
We show in appendix D that the average value of the neuron local field, u, at learning epoch depends on four additive terms:
[TABLE]
Provided that , as , time averages of observables converge to a constant. So that and . Therefore, asymptotically:
[TABLE]
where:
[TABLE]
Therefore, the asymptotic local field () is the sum of the stimulus (input pattern) plus an additional vector which accounts for the history of the system. Note that equations (18), (19) characterize the asymptotic regime which usually corresponds to a fixed-point (see fig 2) with limited dynamical and functional interest (see e.g. fig. 4). On intermediate time scales, eq. (17) must be considered. It shows that the local field u contains a constant component (the input pattern) as well as additional (history-dependent) terms whose relative contribution cannot systematically be predicted.
Figure 3 shows numerical simulations of the evolution of the local field u during learning. Clearly, while the initial values are random, the local field (thin full line) shows a marked tendency to converge to the input pattern (thick dashed line) after as soon as learning epochs. The convergence is complete after learning epochs. An additional term corresponding to is observed numerically (but is hardly visible in the normalized representations of fig. 3). This last term has an interesting structure in the case of the learning rule (3). Indeed, in this case:
[TABLE]
so that:
[TABLE]
where :
[TABLE]
can be interpreted as an order parameter. A large positive means that neurons are mainly saturated to , while a small corresponds to neuron whose average activity is close to .
Note that is related to a set of self-consistent equations. Indeed, since one has:
[TABLE]
In the case where this constant asymptotic attractor is a fixed point (i.e. the attractor with smallest complexity), one has:
[TABLE]
where and denote the values of u and x, respectively, on the fixed point attractor. Here, the set of nonlinear self-consistent equations (22) includes both a local () and a global term (the order parameter ). Assume that we slightly perturb the system, for example by removing the stimulus for some neurone . If the system (22) is away from a bifurcation point, this perturbation is expected to result in only a slight change in . Alternatively, if a bifurcation occurs, a dramatic change in can take place. This local modification of activity may in turn yield a big change in , which corresponds to a global (i.e. network-wide) modification of activity, through a some avalanche-like mechanism. On practical grounds this means that presentation or removal of some parts of the input pattern may induce a drastic change of the dynamics of the network.
IV Functional viewpoint
Pattern recognition is one of the functional properties of RRNNs. In our terms, a pattern is “learned” when its presentation (or removal) induces a bifurcation 555This idea, as well as the preceding works of the authors on this topic was deeply influenced by Freeman’s work Freeman (1987); Freeman et al. (1988).. Moreover, this effect must be acquired via learning, selective (i.e. only the presented pattern is learned) and robust (i.e. a noisy version of the learned pattern should lead to an attractor similar to the one reached after presentation of the learned pattern). We now proceed to an analysis of the effect of pattern removal, as a simple indicator of the functional properties of the network. A deeper investigation of the functional properties of the network is out of the scope of the present study and will be the subject of future works.
Label by x (resp. u) the neuron firing rate (resp. local field) obtained when the (time constant) input pattern is applied to the network (see eq. 1) and by (resp. ) the corresponding quantities when is removed (\mbox{\boldmath\xi}=0). The removal of modifies the attractor structure and the average value of any observable (though the amplitude of this change depends on ). More precisely call:
[TABLE]
where is the (time) average value of without and the average value in the presence of . Two cases can arise.
In the first case, the system is away from a bifurcation point and removal results in a variation of that remains proportional to provided is sufficiently small (remember here that the present network admits a single attractor at a given learning epoch). Albeit common for non-chaotic dynamics, we emphasize that this statement still holds for chaotic dynamics. This has been rigorously proven for uniformly hyperbolic systems, thanks to the linear response theory developed by Ruelle Ruelle (1999). In the present context, the linear response theory predicts that the variation of the average value of u is given by Cessac and Sepulchre (2006, 2007):
[TABLE]
where
[TABLE]
is a matrix666The convergence of this series is discussed in Ruelle (1999); Cessac and Sepulchre (2004, 2006). Note that a similar formula can be written for an arbitrary observable , but is more cumbersome., 777Incidentally, this equation shows once again why the synaptic weight matrix is not sufficient to capture the dynamical effects of a perturbation. Indeed, it contains a purely topological term () and also depends on a “purely dynamical” term that involves an average of the derivative of the transfer functions along the orbit of the neural network. whose entries can be written:
[TABLE]
where the sum holds on every possible path of length , connecting neuron to neuron , in steps.
Note therefore that \Delta^{(T)}\left[\textbf{u}\right]=-\mbox{\boldmath\xi}-M^{(T)}\mbox{\boldmath\xi} where the matrix integrates dynamical effects. A slight variation of at implies a reorganization of the dynamics which results in a complex formula for the variation of , even if the dominant term is , as expected. More precisely, as emphasized several times above, one remarks that each path in the sum is weighted by the product of a topological contribution depending only on the weights and on a dynamical contribution. The weight of a path depends on the average value of thus on correlations between the state of saturation of the units at times .
Eq. 25 shows how the effects of pattern removal are complex when dealing with a chaotic dynamics. However, the situation is much easier mathematically in the simplest case where dynamics have converged to a stable fixed point (resp. ). In this case, eq. (25) reduces to:
[TABLE]
Calling the eigenvalues and eigenvectors of , ordered such that one obtains:
[TABLE]
where denotes the usual scalar product. Actually, this result can easily be found without using linear response, by a simple Taylor expansion (see appendix E). The response is then proportional to but becomes arbitrary large when tends to and provided that \left({\bf v}_{1},\mbox{\boldmath\xi}\right)>0. This analysis can be formally extended to the general case (i.e. including chaos, eq. 26) but is delicate enough to deserve a treatment by its own and will be the scope of a forthcoming paper888This can be achieved by formally “diagonalizing” the matrices but the problem is that eigenvalues and eigenvectors now depend on the time . Information about the time dependence of the spectrum can be found using the Fourier transform of the matrix and looking for its poles Cessac and Sepulchre (2006). These poles are closely related to the graph structure induced by the Jacobian matrices, by standard traces formula and cycle expansions Gaspard (1998). Essentially, we expect that, under the effect of learning, the leading resonances move toward the real axis leading to a singularity at the edge of chaos. The motion should be closely related to the reinforcement of feedback loops discussed in appendix F.. Here, we simply want to make the following argument. From the analysis above, we expect pattern removal to have a maximal effect at “the edge of chaos”, namely when the (average) value of the spectral radius999There is a subtlety here. We have , while in formula (29) we consider the eigenvalues of . However, if are eigenvalues and eigenvectors of then . Therefore, are eigenvalues and eigenvectors of . of is close to . As mentioned above, the effects are however more or less prominent according to the choice of the observable . We empirically found that the effects were particularly prominent with the following quantity:
[TABLE]
Indeed, is maximal when the local field of falls in the central pseudo-linear part of the transfer function, hence where neuron is the most sensitive to its input. Hence measures how neuron excitability is modified when the pattern is removed. The evolution of during learning following rule eq.(5) is shown on fig. 4 (full lines) for two values of the passive forgetting rate . is found to increase to a maximum at early learning epochs, while it vanishes afterwards. Interestingly, comparison with the decay of the leading eigenvalue of the Jacobian matrix, (dotted lines) shows that the maximal values of are obtained when is close to . Hence, these numerical simulations confirm that sensitivity to pattern removal is maximal when the leading eigenvalue is close to . Therefore, “Hebb-like” learning drives the global dynamics through a bifurcation, in the neighborhood of which sensitivity to the input pattern is maximal. This property may be crucial regarding memory properties of RRNNs, which must be able to detect, through their collective response, whether a learned pattern is present or absent. This property is obtained at the frontier where the strange attractor begins to destabilize (), hence at the so-called “edge of chaos”.
We showed in section III.1 that the Hebbian learning rules studied here contract the spectral radius of so that the latter crosses the value at some learning epoch. Thus, is ensured to be an eigenvalue of at some point . The evolution of , the eigenvector associated to the leading eigenvalue of the Jacobian matrix , is less obvious. We plot on fig. 3 (dotted lines) the evolution of its real part during numerical simulations (actually, its imaginary part vanishes after just a couple of learning epochs). It is clear from numerical simulations that the possibility of a vanishing projection of the input pattern (thick dashed line) on can be ruled out (the two vectors are not orthogonal). The tendency is even opposite, i.e. is found to align on the input pattern at long learning epochs (; note that we were not able to find a satisfactory explanation for this alignment).
V Discussion
The coupled dynamical system studied in the present paper (eqs.(1) and (2)) is based on several simplifying assumptions that allowed the rigorous mathematical study we have presented. However, many of the results we obtain remain valid when some of these assumptions are relaxed to improve biological realism. Here, we give a brief overview of the related arguments. As already stated in the introduction, we do not pretend to encompass the spectrum of complexity and richness of biological learning and plasticity rules Kim and Linden (2007). However, the present study focuses on the major type of synaptic plasticity (i.e Hebbian plasticity), which is generally considered as the principal cellular basis of behavioral learning and memory.
The learning rule we study here eq.(2) includes a term that allows passive forgetting (). This possibility is supported by a body of experimental data that shows that synaptic weights decay exponentially toward their baseline after LTP, in the absence of subsequent homo- or hetero-synaptic LTD, with time constants from seconds to days Abraham et al. (1994); Brager et al. (2003); Abraham et al. (2002). A plausible molecular mechanism for this passive behavior has been recently proposed, which relies on the operation of kinase and phosphatase cycles that are systematically implicated in learning and memory Delord et al. (2007). Our theoretical results predict that learning-induced reduction of dynamics complexity can still arise in the limit case of . Indeed, numerical simulations of Hebbian learning rules devoid of passive forgetting (i.e. with ) have clearly evidenced a reduction of the attractor complexity during learning Berry and Quoy (2006); Siri et al. (2006). In this case, the reduction of the attractor complexity is provoked by an increase of the average saturation level of the neurons, in agreement with our present analytical results. As a matter of fact, the question is not so much to know what exactly is the value of in real neural networks, but how the characteristic time scale compares to other time scales in the system.
Another assumption of the generic Hebbian rule we study is that whenever the presynaptic neuron is silent. As already mentioned section II.1, an interpretation of this assumption is that this learning rule excludes heterosynaptic LTD. To assess the impact of this form of synaptic depression in the model, we ran numerical simulations using a variant of eq.(5) in which the Heavyside term (that forbids heterosynaptic LTD) was omitted. The results of these simulations (not shown) were in agreement with all the analytical results supported here, including those on spectral radius contraction. In agreement with these numerical simulations, our analytical results on the contraction of the spectral radius are expected to remain valid when heterosynaptic LTD is accounted for, but this would require extending the model definition and further mathematical developments that are out of the scope of the present study.
The effects of Hebbian learning were studied here in a completely connected, one population (i.e. each neuron can project both excitatory and inhibitory synapses) chaotic network. While this hypothesis allows a rigorous mathematical treatment, it is clearly a strong idealization of biological neural networks. However, we have tested the analytical predictions obtained here with numerical simulations of a chaotic recurrent neural network with connectivity mimicking cortical micro-circuitry, i.e. sparse connectivity and distinct excitatory and inhibitory neuron populations. These simulations unambiguously demonstrated that our analytical results are still valid in these more realistic conditions Siri et al. (2007).
From a functional point of view, we have shown that the sensitivity to the learned pattern is maximal at the edge of chaos. Starting from chaotic dynamics, this regime is reached at intermediate learning epochs. However, longer learning times result in poorer dynamical regimes (e.g. fixed points) and the loss of sensitivity to the learned pattern. Additional plasticity mechanisms like synaptic scaling Turrigiano et al. (1998) or intrinsic plasticity ref Daoudal and Debanne (2003) may constitute interesting biological processes to maintain the network in the vicinity of the edge of chaos and preserve a state of high sensitivity to the learned pattern. Such possibilities are currently under investigation in our group.
Acknowledgements.
This work was supported by a grant of the French National Research Agency, project JC05_63935 “ASTICO”.
Appendix A Definitions.
Dealing with chaotic systems, one is faced with the necessity to defining indicators measuring dynamical complexity. There are basically two families of indicators: one is based on topological properties (e.g. topological entropy), the other is based on statistical properties (e.g. Lyapunov exponents or Kolmogorov-Sinai entropy). The latter family can easily be accessed numerically or experimentally by time averages of relevant observables along typical trajectories of the dynamical system. However, to this aim, one has to assume a strong ergodic property: the time average of observables, along trajectories corresponding to initial conditions drawn at random with respect to a probability distribution having a density (with respect to the Lebesgue measure), is constant (it does not depend on the initial condition). This property is far from being evident. Actually, we are not able to prove it in the present context. On mathematical grounds, it corresponds to the following assumption.
Assumption 1
Call is the Lebesgue measure on and let the image of under . We assume that the following limit exists:
[TABLE]
where the probability measure is called “the Sinai-Ruelle-Bowen (SRB) measure at learning epoch ” Sinai (1972); Ruelle (1978); Bowen (1975)**. Under this assumption the following holds. Let be some suitable (measurable) function. Then the time average:
[TABLE]
where , is equal to the ensemble average:
[TABLE]
for Lebesgue-almost every initial condition .
In other words, time average and ensemble average are identical on practical grounds. The use of is required to prove the mathematical results below while time average is what we use for numerical simulations.
Note that in doing so, we have constructed a family of probability distributions that depends on the learning epoch . provides statistical information about the attractor structure. A prominent example is the maximal Lyapunov exponent. Let , and be an SRB measure. Then, the largest Lyapunov exponent is given by:
[TABLE]
Its value is constant for almost every x. (Note indeed that the LHS does not depend on x, while the RHS does. This is a direct consequence of the assumption that is an SRB measure).
Appendix B Asymptotic behaviors
In the specific learning rule eq.(5) used in our numerical simulations, . Thus
[TABLE]
where denotes the transpose of vector , denotes a sum restricted to the active neurons and is the fraction of active neurons. Hence
[TABLE]
If (as observed in our numerical simulations) tends to a stationary value then
[TABLE]
Hence is bounded in the specific case of eq.(5) by a constant .
More generally, is bounded provided that the function in (3) is bounded as well.
Appendix C Proof of theorem 1
Let . Denote by , and , . From the chain rule:
[TABLE]
[TABLE]
Therefore:
[TABLE]
Since :
[TABLE]
But since , we have .
Appendix D Local fields
Fix x and the time epoch . Set \textbf{u}={\cal W}^{(T)}\textbf{x}+\mbox{\boldmath\xi}. The average of u, is defined either by the time average (32) or by the ensemble average (33). However, since is constant during a given learning epoch one has:
[TABLE]
Therefore:
[TABLE]
where is the difference of the average value of x between learning epochs and .
Thus:
[TABLE]
and by recurrence:
[TABLE]
Appendix E Proof of eq.(29)
Call () the fixed point (for the variable u) with (without) . We have:
[TABLE]
and:
[TABLE]
Therefore:
[TABLE]
A series expansion yields, to the linear order:
[TABLE]
Decomposing on the eigenbasis of we obtain:
[TABLE]
which corresponds to eq. (29) provided (ensuring that the matrix is invertible).
Appendix F Jacobian matrix and feedback loops
background
Assume that we slightly perturb at time the state of neuron with a small perturbation (e.g. ). Then the effect of this change on neuron , at time is given by . One can perform a Taylor expansion of this expression in powers of . To the linear order the effect is given by . To each Jacobian matrix one can associate a graph, called “the graph of linear influences”. such that there is an oriented edge . The edge is positive if and negative if . An important remark is that this graph depends on the current state x, contrarily to the weights matrix which is a constant inside a given learning epoch. This has important consequences. Indeed, in our case since , the edge in the graph of linear influences can be very small even if the synaptic weight is large. It suffices that be large. This effect, due to the saturation of the transfer function , is prominent in the subsequent studies.
We have now the following situation: “above” (in the tangent bundle) each point x, there is graph. This graph contains circuits or feedback loops. If is an edge, denote by the origin of the edge and its end. Then a circuit is a sequence of edges such that , , and . Such a circuit is positive (negative) if the product of its edges is positive (negative). A positive circuit basically yields (to the linear order) a positive feedback that induces an increase of the activity of the neurons in this circuit. Obviously, there is no exponential increase since rapidly nonlinear terms will saturate this effect. It is thus expected that positive loops enhance stability.
A particularly prominent example of this is well known in the framework of continuous time neural networks models and also in genetic networks. It is provided by so-called “cooperative systems”. A dynamical system is called cooperative if . Therefore, in this case, all edges are positive edges101010More generally, there is a variable change which maps the initial dynamical system to a cooperative system with positive edges., whatever the state of the neural network and all circuits are positive. Cooperative systems preserve the following partial order . Thus (this corresponds to the positive feedback discussed above). From these inequalities, Hirsch Hirsch (1989) proved that for a two dimensional cooperative dynamical system, any bounded trajectory converges to a fixed point. In larger dimension, one needs moreover a technical condition on the Jacobian matrix: it must be irreducible. Then Hirsch proved that the -limit set of almost every bounded trajectory is made of fixed points. Note that this result holds when is nonlinear.
On the opposite, negative loops usually generate oscillations. For example, the second Thomas conjecture Thomas (1981), proved by Gouzé Gouzé (1998) under the hypothesis that the sign of the Jacobian matrix elements do not depend on the state, states that “A negative loop is a necessary condition for a stable periodic behavior”. In our model, negative loop generate oscillations provided that the nonlinearity is sufficiently large. This can be easily figured out by considering a system with 2 neurons. A necessary condition to have a Hopf bifurcation giving rise to oscillations is , but the bifurcation occurs only when is large enough.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Abraham et al. (1994) Abraham, B., W.C. Christe, B. Logan, P. Lawlor, , and M. Dragunow, 1994, Proc. Natl. Acad. Sci. USA 91 , 10049.
- 2Abraham et al. (2002) Abraham, W., B. Logan, J. Greenwood, and M. Dragunow, 2002, J. Neurosci. 22 , 9626.
- 3Abraham and Bear (1996) Abraham, W. C., and M. F. Bear, 1996, Trends Neurosci. 19 , 126.
- 4Atay. et al. (2006) Atay., F., T. Biyikoglu, and J. Jost, 2006, Physica. D .
- 5Atay et al. (2006) Atay, F., T. Biyiko u glu, and J. Jost, 2006, Physica D 224 , 35.
- 6Barahona and Pecora (2002) Barahona, M., and L. Pecora, 2002, Phys. Rev. Lett. 89 , 054101.
- 7Bear and Abraham (1996) Bear, M., and W. Abraham, 1996, Annu. Rev. Neurosci. 19 , 437.
- 8Berry and Quoy (2006) Berry, H., and M. Quoy, 2006, Adaptive Behavior 14 , 129.
