9 November 2011 in The Journal of Neuroscience
The distribution ofin vivoaverage firing rates within local cortical networks has been reported to be highly skewed and long tailed. The distribution of average single-cell inputs, conversely, is expected to be Gaussian by the central limit theorem. This raises the issue of how a skewed distribution of firing rates might result from a symmetric distribution of inputs. We argue that skewed rate distributions are a signature of the nonlinearity of thein vivo f–Icurve. Duringin vivoconditions, ongoing synaptic activity produces significant fluctuations in the membrane potential of neurons, resulting in an expansive nonlinearity of thef–Icurve for low and moderate inputs. Here, we investigate the effects of single-cell and network parameters on the shape of thef–Icurve and, by extension, on the distribution of firing rates in randomly connected networks.
17 September 2018 in Nature Neuroscience
1 October 2017 in Current Opinion in Neurobiology
10 April 2012 in Physical Review Letters
We present a mean-field theory for spiking networks operating in the balanced excitation-inhibition regime, with synapses displaying short-term plasticity. The theory reveals a novel mechanism for bistability which relies on the nonlinearity of the synaptic interactions. As synaptic nonlinearity is mainly controlled by the spiking rates, the different states are stabilized by dynamically generated changes in the noise level. Thus, in both states, the network operates in the fluctuation-driven regime, producing activity patterns characterized by strong spatiotemporal irregularity.
1 July 2008 in Neural Computation
We present an online version of the expectation-maximization (EM) algorithm for hidden Markov models (HMMs). The sufficient statistics required for parameters estimation is computed recursively with time, that is, in an online way instead of using the batch forward-backward procedure. This computational scheme is generalized to the case where the model parameters can change with time by introducing a discount factor into the recurrence relations. The resulting algorithm is equivalent to the batch EM algorithm, for appropriate discount factor and scheduling of parameters update. On the other hand, the online algorithm is able to deal with dynamic environments, i.e., when the statistics of the observed data is changing with time. The implications of the online algorithm for probabilistic modeling in neuroscience are briefly discussed.