Cusps Enable Line Attractors for Neural Computation

Cusps Enable Line Attractors for Neural Computation


Line attractors in neuronal networks have been suggested to be the basis of many brain functions, such as working memory, oculomotor control, head movement, locomotion, and sensory processing. In this paper, we make the connection between line attractors and pulse-gating in feedforward neuronal networks. In this context, because of their neutral stability along a one-dimensional manifold, line attractors are associated with a time-translational invariance that allows graded information to be propagated from one neuronal population to the next. To understand how pulse-gating manifests itself in a high-dimensional, non-linear, feedforward integrate-and-fire network, we use a Fokker-Planck approach to analyze system dynamics. We make a connection between pulse-gated propagation in the Fokker-Planck and population-averaged mean-field (firing rate) models, then identify an approximate line attractor in state space as the essential structure underlying graded information propagation. An analysis of the line attractor shows that it consists of three fixed points: a central saddle with an unstable manifold along the line and stable manifolds orthogonal to the line, which is surrounded on either side by stable fixed points. Along the manifold defined by the fixed points, slow dynamics give rise to a ghost. We show that this line attractor arises at a cusp catastrophe, where a fold bifurcation develops as a function of synaptic noise; and that the ghost dynamics near the fold of the cusp underly the robustness of the line attractor. Understanding the dynamical aspects of this cusp catastrophe allows us to show how line attractors can persist in biologically realistic neuronal networks and how the interplay of pulse gating, synaptic coupling and neuronal stochasticity can be used to enable attracting one-dimensional manifolds and thus, dynamically control the processing of graded information.



I Introduction

Attractor neural networks have been appealed to by theoretical neuroscientists to explain working memory (Wang, 2001), oculomotor control (Seung, 1996), head movement (Zhang, 1996), locomotion (Bruno et al., 2015), sensory processing (Ben-Yishai et al., 1995) and many other experimentally observed brain functions. Some of these neuronal functions have been rationalized using the persistent activity of an attractor (e.g., working memory), while other functions have been modeled by the gradedness (i.e., order preserving property (Machens et al., 2005)) of an attractor (e.g., oculomotor control and sensory processing). Because of these dynamical features, attractor networks have been particularly useful in modeling the encoding of continuous external stimuli (Mante et al., 2013) or the maintenance of internal neuronal representations (Machens et al., 2005). Furthermore, it has been shown that attractor network dynamics have the capacity to perform optimal computations (Latham et al., 2003) and thus, can implement Bayesian inference (Wu et al., 2003; Deneve et al., 2007).

Pulse-gating is a mechanism capable of transferring packet-based spiking activity from one neuronal population to another (Sornborger et al., 2015; Wang et al., 2016). For instance, the synfire-gated synfire chain (SGSC) (Wang et al., 2016) is a mechanism consisting of two sets of neural populations, one representing rate-coded (graded) information and another that gates the flow of that information. This separation into information-carrying and information-control populations provides a basis for understanding how some brain areas can be responsible for the control of information transfer (Gisiger and Boukadoum, 2011), such as the mediodorsal nucleus of the thalamus (Floresco and Grace, 2003), and others for information processing, such as the somatosensory areas (Hernandez et al., 2000).

The original information propagation model that demonstrated the concept of pulse-gated firing rate propagation was based on a mean-field firing rate model of a network of current-based integrate-and-fire (I&F) neurons that was coarse-grained in time. There was good correspondence between the mean-field model and mean spiking rates in a network of I&F neurons (Sornborger et al., 2015; Wang et al., 2016). However, in general, mean-field models make critical use of the relationship between firing rate and current (f-I curves) (or other input-output functions), which correspond to the steady-state responses of a population of neurons driven by a constant input. There is no a priori reason that a temporally-averaged mean-field model should correspond with an I&F network in a transiently driven (pulse-gating) context. Furthermore, the original mean-field solution that demonstrated pulse-gated information propagation suffered from parameter fine-tuning (Seung, 1996; Goldman, 2008; MacNeil and Eliasmith, 2011), even though I&F simulations appeared robust to parameter variability.

In this paper, in order to better understand the robustness of pulse-gated, graded information transfer in a network of spiking neurons, we construct Fokker-Planck equations describing the membrane potential probability density function in a feedforward network and study solutions in the state space of a dimensionally-reduced iterative dynamical system. After outlining our methods, we show that pulse-gating in feedforward networks gives rise to approximately time-translationally-invariant spiking probabilities that are propagated from layer to layer in a feedforward network. We then examine synaptic current input-output relations allowing for the construction of an effective population firing rate model and show that this model, averaged across neuronal populations, is very similar to a mean-field model based on rectified linear input-output functions. We show how the input-output function depends on synaptic coupling, gating pulse amplitude, and synaptic noise, and that there is a sizeable region of parameter space within which graded propagation exists.

We then demonstrate the dynamical convergence of membrane potential density to a one-dimensional manifold in parameter space. The Fokker-Planck system reveals that this one-dimensional manifold arises due to a saddle node bifurcation creating an unstable fixed point in the center of a one-dimensional manifold and two stable fixed points on either side of the saddle node. Dynamics orthogonal to the one-dimensional manifold give rise to rapid convergence to the one-dimensional manifold. Ghost (slow) dynamics along the one-dimensional manifold allow the unstable manifold of the saddle to be viewed as an attracting one-dimensional manifold.

We finally show that this approximate line attractor is robust and generic. By using a reduced analytical model of gating induced transients in the Fokker-Planck system, we show that the propagation of firing amplitudes can be mapped to a cusp catastrophe, and that a bundle of one-dimensional ghost manifolds exists in the region surrounding the fold of the cusp. Our results reveal how the coordination of pulse-gating, synaptic coupling, and membrane potential dynamics enables approximate line attractors in feedforward networks and demonstrate the robustness of graded information propagation when pulse-gating is incorporated.

Ii Methods

We study a feedforward network of populations of excitatory, current-based, integrate-and-fire (I&F) neurons whose membrane potential, , and synaptic current are described by


where is the rest voltage (also the reset voltage), is the synaptic timescale, is the synaptic coupling strength, is a Bernoulli distributed random variable and is the mean synaptic coupling probability. The ’th spike time of the ’th neuron in layer is determined by , i.e. when the neuron reaches threshold (after which is immediately reset to ). The gating current, , is a white noise process with a square pulse envelope, , where is a Heaviside theta function and is the pulse length (Sornborger et al., 2015) of pulse height and variance . Note that an exponentially decaying current is injected in population providing synchronized activity that will subsequently propagate downstream through populations .

Figure 1: Graded, pulse-gated propagation in a neural Fokker-Planck model. A) Graded population density transfer. Population densities in upstream, , and downstream, , layers. These are two layers from a layer feedforward network with ms, , , and . Pulses gating the upstream and downstream populations are depicted at the bottom of this panel and similarly for subsequent panels. Colorbar applies to both population density plots. B) Synaptic current, (blue), and firing rate, (magenta), in upstream and downstream layers. Inset shows a comparison of a mean-field firing rate model (dashed red) with the population-averaged Fokker-Planck model (blue). Below the plot, we show the timing of the gating pulses. C) Graded firing rates showing faithful, pulse-gated propagation across layers. The sets of successive blue traces (six amplitudes from bottom to top) are currents from each population. Gradedness is shown by the fact that the pulses retain their height (roughly) and order as they propagate from population to population. Gating pulses for the solutions depicted are shown at the bottom of each panel.

Feedforward networks of this type admit discrete-time-translationally-invariant solutions describing graded packet transfer Sornborger et al. (2015); Wang et al. (2016). Such solutions exist for gating pulses that are either temporally sequential or overlapping Wang et al. (2016).

To understand this phenomenon, we used a Fokker-Planck analysis. Assuming the spike trains in Eq. (1b) to be Poisson distributed, the collective behavior of this feedforward network may be described by the (Fokker-Planck) equations


These equations describe the evolution of the probability density function, , in terms of the probability density flux, , the mean feedforward synaptic current, , and the population firing rate, . For each layer, , the probability density function gives the probability of finding a neuron with membrane potential at time .

The probability density flux is given by

The effective diffusivity is


(Below, we take and neglect the second term on the right in (3).) The population firing rate is the flux of the probability density function at threshold,


The boundary conditions for the Fokker-Planck equations are , , and .

To improve the efficiency of exploring the bifurcation structure of this system in a large state space, we also investigate an approximate model in which the initial distribution is assumed to be Gaussian, , with width and mean , where is a normalization factor accounting for the truncation of the Gaussian at threshold, . As the gating current turns on, the distribution is uniformly advected toward the voltage threshold, , and the population begins to fire. Uniform advection neglects a small amount of firing due to a diffusive flux across the firing threshold, thus the fold bifurcation (see Results) occurs at a slightly larger value of synaptic coupling, , for this approximation relative to numerical simulations. Since the timescale of the pulse is fast, neurons only have enough time to fire once (approximately). Thus, we neglect the re-emergent population at , which contributes negligibly to firing during the transient pulse.

With this approximation, Eq. (2a) gives rise to , where . With upstream current . Setting , this integrates to

and from Eq. (4), we have

which, from Eq. (2b), results in a downstream synaptic current at


After the end of the pulse, the current decays exponentially. This decaying current feeds forward and is integrated by the next layer. Thus, for an exact transfer, .

Figure 2: Current transfer in the Fokker-Planck model. A) Downstream firing rates plotted for given upstream synaptic input currents. B) Downstream currents plotted for given upstream synaptic input currents. Note that the peak of the current at the end of the gating pulse, indicated by the vertical red line, is very close to the value of the synaptic input current. For (A) and (B), , ms, , and . C) Current transfer functions, , for three values of the gating current, . Here, . Note that changing the gating current moves the input-output function vertically upwards. D) Current transfer functions for three values of the synaptic coupling, . Here, . Note that changing the synaptic coupling changes the slope of the input-output function. E) An optimal current transfer function, with and . Note that this transfer function closely approaches the diagonal over a large range of inputs. F) The distance of the current transfer function from the diagonal. The broad, roughly linear, range of gating currents, , and synaptic couplings, , for which the distance is small indicates a large region of parameter space over which graded information may be faithfully propagated.

Iii Results

In Fig. 1, we show that population density (Fig. 1A), and graded current and firing rate (Fig. 1B) may be propagated via pulse-gating between layers in the Fokker-Planck model. In Fig. 1B inset, we compare currents between a time-averaged firing rate model of pulse-gated graded information propagation and the Fokker-Planck model. For a given value of in a mean-field rate model, we can find an exact . Because of the slow onset of firing (blue, inset) relative to the firing rate model (dashed red, inset), the value of synaptic coupling that gave rise to graded transfer, , was larger than the mean-field prediction, (see Appendix), by a factor of for near ms. In Fig. 1C, we demonstrate stable graded propagation across many layers.

In Fig. 2A,B, we show firing rates and corresponding current amplitudes for a range of input currents in the Fokker-Planck model. For all but the lowest input current, the output current (the current at the end of the gating pulse) is very close to the input current. Plotting input versus output current for ranges of gating currents, (Fig. 2C), and synaptic couplings, (Fig. 2D), we find that changes in gating currents translate the input-output function upwards and changes in synaptic coupling change the slope of the input-output function. By varying and , we can find an optimal input-output function very close to the diagonal (Fig. 2E), hence giving very accurate propagation of graded information. A nearby basin of parameters also gives good graded propagation (Fig. 2F) as measured by the distance of the input-output function from the diagonal. The input-output function in Fig. 2E may be used in a population firing rate model for large pulse-gated systems for which spiking networks are impractical.

In the graded transfer regime, the probability density may be described by a few of its low-lying moments, viz. and . Changes in the moments are related to changes in the shape of the density. Higher moments rapidly converge to the one-dimensional manifold (not shown). To identify time-translationally invariant solutions admitting graded propagation, we search for parameters, , , etc. such that for a given , .

In Fig. 3, we plot the map for successive values of (i.e. mapping feedforward propagation from layer to layer). As may be seen in Fig. 3, for parameters admitting graded information propagation, initial conditions rapidly approach a one-dimensional manifold. On the manifold itself, there are three fixed points, two stable fixed points at the extremes and one unstable saddle in between. For these parameters, the dynamics along the unstable direction of the saddle are slow. On the other hand, the dynamics along the stable direction of the saddle (orthogonal to the one-dimensional manifold) are fast. Thus, after an initial transient taking the packet to the one-dimensional manifold, the amplitude and waveform of each packet remain relatively unchanged from transfer to transfer. Furthermore, the relative ordering of the amplitudes is retained even as the amplitude slowly changes.

Figure 3: The slow manifold of graded propagation. A) Trajectories, for successive values of , showing the rapid approach of the initial distribution to a one-dimensional manifold and the slow evolution along the manifold representing the slow decay of the waveform. The trajectories are plotted as red lines with blue arrows at the tip. Small blue tips along the one-dimensional manifold show the slow evolution. B) The trajectories in A) projected onto the plane. In this panel, the black dots indicate the three fixed points on the one-dimensional manifold (outer fixed points stable, middle fixed point unstable). C) The trajectories in A) projected onto the plane. Parameters are as in Fig. 1.

Fixed points of the map are shown in Fig. 4, showing a fold bifurcation (along the unstable manifold of the saddle) as a function of .

As moves away from the region of graded transfer, the dynamics along the unstable manifold become fast. Thus, all amplitudes rapidly approach the fixed points at the extremes. This leads to a mechanism for binary information transfer (in distinction from graded information transfer), where pulse gating can only transfer low and high amplitudes. As increases, the location of the high fixed point increases giving more distinction between low and high fixed points.

This behavior may be understood across a large region of parameter space with the use of the approximate, Gaussian model (see Methods).

Figure 4: Bifurcation diagram generated using numerically integrated Fokker-Planck equations (2), for . The saddle-node bifurcation occurs at approximately . Blue indicate unstable fixed points, and red indicates stable fixed points. For values close to the trajectory evolves slowly along the one-dimensional manifold due to a fold bifurcation ghost, allowing graded propagation across many layers before significant change in the waveform.

In Fig. 5A,B, we compare numerical and approximate (Gaussian) solutions. Note the similar advection of the population density with obvious differences in curvature and reset populations (which may be seen in Fig. 5A as a linear wall of density along the reset value, , of the membrane potential). In Fig. 5C, we show the fold bifurcation, found numerically in Fig. 4, for a range of values of and . In Fig. 5D, we demonstrate the existence of a cusp catastrophe as a function of the width of the potential distribution . In Fig. 5E,F, we show how fast or slow (ghost) dynamics occur near the fold of the cusp depending on and . In Fig. 5E,F, blue shades indicate locations where feedforward amplitudes are slowly changing, green and yellow shades where amplitudes change rapidly. Isoclines (the same in both panels) are plotted denoting the fixed point (central isocline) and nearby locations of small, but non-zero change. Note how in Fig. 5E,F, dynamics are fast and amplitudes rapidly approach the attractors for large synaptic coupling, but dynamics remain slow in the region near the fold bifurcation. This region gives rise to an approximate line attractor that becomes more robust, i.e. covering a large range of amplitudes (), as increases (compare Fig. 5E and Fig. 5F).

Figure 5: -induced fold bifurcation ghost at cusp catastrophe. A) The probability density as a function of time and membrane potential from a numerical simulation. B) The probability density as a function of time from the transient pulse approximation. C) A plot of the surface of zeros of plotted for with . These are fixed points of the map of the synaptic feed forward current generated from Eqs. (5). Note the fold bifurcation across many values of , similar to that found numerically in Fig. 3. D) A plot of the surface of zeros of plotted for with . Note the obvious cusp catastrophe that occurs along the -axis. E) Zeros of for and plotted on a colored background, where the color indicates the speed of departure toward stable fixed points (either upward above the unstable fixed point or downward below the unstable fixed point). For small , solutions rapidly approach the fixed points, giving a propagated binary code for large . F) Zeros of for and again indicating the speed of departure toward stable fixed points. For near the cusp, there is a large region within which propagation away from the unstable point is slow, called a ghost. Ghosts occur near the cusp locus producing a bundle of models in parameter space that allow graded propagation across many layers.

Iv Discussion

To understand pulse-gated information propagation, we used a Fokker-Planck analysis to derive input-output curves that may be used in population firing rate models of pulse-gated propagation and to reveal an approximate line attractor in the network of spiking neurons. We further showed that the line attractor is associated with ghost dynamics occurring along the front fold (relatively small synaptic coupling) of a cusp catastrophe as varies in state space. Locally, the nearly one-dimensional attracting manifold is the result of a fold bifurcation where the stable directions of the saddle and attracting fixed points are strongly attracting and the unstable manifold exhibits ghost dynamics. In terms of input-output functions, this reflects that the fold of this cusp separates a region of sigmoidal f-I curves, with a relatively large linear interval, from a region of bistability. Since this region occupies a sizeable volume in parameter space, the graded propagation is robust. Furthermore, the fact that a common cusp catastrophe underlies the fast timescale dynamics of our system indicates that this type of line attractor is generic and will persist in feedforward networks of other types of spiking neurons.

One of the major problems of neuroscience is to understand how complex neural functions emerge from the collective dynamics of neuronal networks. Towards this goal, researchers have tried to construct models using mean-field firing rate theories and large-scale numerical simulations. However, except for a few examples (e.g. (Gerstner, 1995; Nykamp and Tranchina, 2000; Cai et al., 2006; Ostojic and Brunel, 2011; Montbrio et al., 2015; Fasoli et al., 2016)), the precise correspondence between the underlying microscopic spiking neurons and the macroscopic coherent dynamics of the neuronal populations has not been established.

Our analysis provides a significant step toward understanding how macroscopic attracting manifolds can emerge from the dynamic interactions of microscopic spiking neurons via the coordination of pulse-gating, synaptic weights, and intrinsic and extrinsic noise (i.e. the distribution of the membrane potential across the population), and offers possible order parameters for which macroscopic descriptions can be derived from the underlying microscopic dynamical model.

Furthermore, transfer mechanisms, such as those found in the graded and binary transfer parameter regimes shown in Fig. 5. (i.e. for near the fold (graded) or to the right of the fold (binary)), provide a novel means of understanding dynamic network interactions such as the detailed measurements of population activity underlying complex neural tasks provided by modern experimental techniques. Already, pulse-gated transfer mechanisms have been shown to be capable of implementing dynamic modules representing complex neural functions, such as short term memory, decision making, and the control of neural circuits (Sornborger et al., 2015; Wang et al., 2016).

V Appendix: Mean Field Model

A mean-field firing rate model of Eq. (1) is given by


where denotes a thresholded linear function, with threshold , for the input-output relation of an I&F neuron.

In (Sornborger et al., 2015), we showed that when the gating pulse cancels the threshold (), and the feedforward synaptic coupling strength was


we get exact, graded propagation, where the mean synaptic current and firing rates were



L.T. thanks the UC Davis Mathematics Department for its hospitality. A.T.S. would like to thank Liping Wei and the Center for Bioinformatics at the School of Life Sciences at Peking University for their hospitality. This work was supported by the Natural Science Foundation of China grants 91232715 (Z.X, L.T.), 31771147 (L.T.), 91430216 (J.Z.), and U1530401 (J.Z.), by the Open Research Fund of the State Key Laboratory of Cognitive Neuroscience and Learning grant CNLZD1404 (Z.X., L.T.), by the Beijing Municipal Science and Technology Commission under contract Z151100000915070 (Z.X., L.T.), and by the Undergraduate Honors Research Program of the School of Life Sciences at Peking University (Z.X., L.T.).


  1. X. J. Wang. Synaptic reverberation underlying mnemonic persistent activity. Trends Neurosci., 24(8):455–463, Aug 2001.
  2. H. S. Seung. How the brain keeps the eyes still. Proc. Natl. Acad. Sci. U.S.A., 93(23):13339–13344, Nov 1996.
  3. K. Zhang. Representation of spatial orientation by the intrinsic dynamics of the head-direction cell ensemble: a theory. J. Neurosci., 16(6):2112–2126, Mar 1996.
  4. A. M. Bruno, W. N. Frost, and M. D. Humphries. Modular deconstruction reveals the dynamical and physical building blocks of a locomotion motor program. Neuron, 86(1):304–318, Apr 2015.
  5. R. Ben-Yishai, R. L. Bar-Or, and H. Sompolinsky. Theory of orientation tuning in visual cortex. Proc. Natl. Acad. Sci. U.S.A., 92(9):3844–3848, Apr 1995.
  6. C. K. Machens, R. Romo, and C. D. Brody. Flexible control of mutual inhibition: a neural model of two-interval discrimination. Science, 307(5712):1121–1124, Feb 2005.
  7. V. Mante, D. Sussillo, K. V. Shenoy, and W. T. Newsome. Context-dependent computation by recurrent dynamics in prefrontal cortex. Nature, 503(7474):78–84, Nov 2013.
  8. P. E. Latham, S. Deneve, and A. Pouget. Optimal computation with attractor networks. J. Physiol. Paris, 97(4-6):683–694, 2003.
  9. S. Wu, D. Chen, M. Niranjan, and S. Amari. Sequential Bayesian decoding with a population of neurons. Neural Comput, 15(5):993–1012, May 2003.
  10. S. Deneve, J. R. Duhamel, and A. Pouget. Optimal sensorimotor integration in recurrent cortical networks: a neural implementation of Kalman filters. J. Neurosci., 27(21):5744–5756, May 2007.
  11. A.T. Sornborger, Z. Wang, and L. Tao. A mechanism for graded, dynamically routable current propagation in pulse-gated synfire chains and implications for information coding. J. Comput. Neurosci., August 2015. doi: 10.1007/s10827-015-0570-8.
  12. Z. Wang, A. T. Sornborger, and L. Tao. Graded, Dynamically Routable Information Processing with Synfire-Gated Synfire Chains. PLoS Comput. Biol., 12(6):e1004979, Jun 2016.
  13. T. Gisiger and M. Boukadoum. Mechanisms Gating the Flow of Information in the Cortex: What They Might Look Like and What Their Uses may be. Front Comput Neurosci, 5:1, 2011.
  14. S. B. Floresco and A. A. Grace. Gating of hippocampal-evoked activity in prefrontal cortical neurons by inputs from the mediodorsal thalamus and ventral tegmental area. J. Neurosci., 23(9):3930–3943, May 2003.
  15. A. Hernandez, A. Zainos, and R. Romo. Neuronal correlates of sensory discrimination in the somatosensory cortex. Proc. Natl. Acad. Sci. U.S.A., 97(11):6191–6196, May 2000.
  16. M.S. Goldman. Memory without feedback in a neural network. Neuron, 61:621–634, 2008.
  17. D. MacNeil and C. Eliasmith. Fine-tuning and the stability of recurrent neural networks. PLoS ONE, 6(9):e22885, 2011.
  18. W. Gerstner. Time structure of the activity in neural network models. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics, 51(1):738–758, Jan 1995.
  19. D.Q. Nykamp and D. Tranchina. A population density approach that facilitates large-scale modeling of neural networks: Analysis and an application to orientation tuning. J. Comput. Neurosci., 8:19–50, 2000.
  20. D. Cai, L. Tao, A.V. Rangan, and D.W. McLaughlin. Kinetic theory for neuronal network dynamics. Comm. Math. Sci., 4:97–127, 2006.
  21. S. Ostojic and N. Brunel. From spiking neuron models to linear-nonlinear models. PLoS Comput. Biol., 7(1):e1001056, Jan 2011.
  22. E Montbrio, D. Pazo, and A. Roxin. Macroscopic description for networks of spiking neurons. Phys. Rev. X, 5:021028, 2015.
  23. D. Fasoli, A. Cattani, and S. Panzeri. The Complexity of Dynamics in Small Neural Circuits. PLoS Comput. Biol., 12(8):e1004992, Aug 2016.
This is a comment super asjknd jkasnjk adsnkj
The feedback cannot be empty
Comments 0
The feedback cannot be empty
Add comment

You’re adding your first comment!
How to quickly get a good reply:
  • Offer a constructive comment on the author work.
  • Add helpful links to code implementation or project page.