Computational Neuroscience Models Research Articles

Generalization in interactive networks: the benefits of inhibitory competition and Hebbian learning.

Computational models in cognitive neuroscience should ideally use biological properties and powerful computational principles to produce behavior consistent with psychological findings. Error-driven backpropagation is computationally powerful and has proven useful for modeling a range of psychological data but is not biologically plausible. Several approaches to implementing backpropagation in a biologically plausible fashion converge on the idea of using bidirectional activation propagation in interactive networks to convey error signals. This article demonstrates two main points about these error-driven interactive networks: (1) they generalize poorly due to attractor dynamics that interfere with the network's ability to produce novel combinatorial representations systematically in response to novel inputs, and (2) this generalization problem can be remedied by adding two widely used mechanistic principles, inhibitory competition and Hebbian learning, that can be independently motivated for a variety of biological, psychological, and computational reasons. Simulations using the Leabra algorithm, which combines the generalized recirculation (GeneRec), biologically plausible, error-driven learning algorithm with inhibitory competition and Hebbian learning, show that these mechanisms can result in good generalization in interactive networks. These results support the general conclusion that cognitive neuroscience models that incorporate the core mechanistic principles of interactivity, inhibitory competition, and error-driven and Hebbian learning satisfy a wider range of biological, psychological, and computational constraints than models employing a subset of these principles.

Encyclopedia of computational neuroscience: The end of the second millennium

Arbib et al. describe mathematical and computational models in neuroscience as well as neuroanatomy and neurophysiology of several important brain structures. This is a useful guide to mathematical and computational modelling of the structure and function of nervous system. The book highlights the need to develop a theory of brain functioning, and it offers some useful approaches and concepts.

Six principles for biologically based computational models of cortical cognition

This review describes and motivates six principles for computational cognitive neuroscience models: biological realism, distributed representations, inhibitory competition, bidirectional activation propagation, error-driven task learning, and Hebbian model learning. Although these principles are supported by a number of cognitive, computational and biological motivations, the prototypical neural-network model (a feedforward back-propagation network) incorporates only two of them, and no widely used model incorporates all of them. It is argued here that these principles should be integrated into a coherent overall framework, and some potential synergies and conflicts in doing so are discussed.

Computational Neuroscience Models to Complement Brain Imaging Data for the Understanding of Working Memory Processes

Computational Neuroscience Models to Complement Brain Imaging Data for the Understanding of Working Memory Processes

On the use of Bayesian methods for evaluating compartmental neural models.

Computational modeling is being used increasingly in neuroscience. In deriving such models, inference issues such as model selection, model complexity, and model comparison must be addressed constantly. In this article we present briefly the Bayesian approach to inference. Under a simple set of commonsense axioms, there exists essentially a unique way of reasoning under uncertainty by assigning a degree of confidence to any hypothesis or model, given the available data and prior information. Such degrees of confidence must obey all the rules governing probabilities and can be updated accordingly as more data becomes available. While the Bayesian methodology can be applied to any type of model, as an example we outline its use for an important, and increasingly standard, class of models in computational neuroscience--compartmental models of single neurons. Inference issues are particularly relevant for these models: their parameter spaces are typically very large, neurophysiological and neuroanatomical data are still sparse, and probabilistic aspects are often ignored. As a tutorial, we demonstrate the Bayesian approach on a class of one-compartment models with varying numbers of conductances. We then apply Bayesian methods on a compartmental model of a real neuron to determine the optimal amount of noise to add to the model to give it a level of spike time variability comparable to that found in the real cell.

One-dimensional Fokker-Planck reduced dynamics of decision making models in computational neuroscience

We study a Fokker-Planck equation modelling the firing rates of two interacting populations of neurons. This model arises in computational neuroscience when considering, for example, bistable visual perception problems and is based on a stochastic Wilson-Cowan system of differential equations. In a previous work, the slow-fast behavior of the solution of the Fokker-Planck equation has been highlighted. Our aim is to demonstrate that the complexity of the model can be drastically reduced using this slow-fast structure. In fact, we can derive a one-dimensional Fokker-Planck equation that describes the evolution of the solution along the so-called slow manifold. This permits to have a direct efficient determination of the equilibrium state and its effective potential, and thus to investigate its dependencies with respect to various parameters of the model. It also allows to obtain information about the time escaping behavior. The results obtained for the reduced 1D equation are validated with those of the original 2D equation both for equilibrium and transient behavior.

The Late Lord Beaconsfield

<h3>Abstract</h3> The Izhikevich artificial spiking neuron model is among the most employed models in neuromorphic engineering and computational neuroscience, due to the affordable computational effort to discretize it and its biological plausibility. It has been adopted also for applications with limited computational resources in embedded systems. It is important therefore to realize a compromise between error and computational expense to solve numerically the model’s equations. Here we investigate the effects of discretization and we study the solver that realizes the best compromise between accuracy and computational cost, given an available amount of Floating Point Operations per Second (FLOPS). We considered three fixed-step solvers for Ordinary Differential Equations (ODE), commonly used in computational neuroscience: Euler method, the Runge-Kutta 2 method and the Runge-Kutta 4 method. To quantify the error produced by the solvers, we used the Victor Purpura spike train Distance from an ideal solution of the ODE. Counterintuitively, we found that simple methods such as Euler and Runge Kutta 2 can outperform more complex ones (i.e. Runge Kutta 4) in the numerical solution of the Izhikevich model if the same FLOPS are allocated in the comparison. Moreover, we quantified the neuron rest time (with input under threshold resulting in no output spikes) necessary for the numerical solution to converge to the ideal solution and therefore to cancel the error accumulated during the spike train; in this analysis we found that the required rest time is independent from the firing rate and the spike train duration. Our results can generalize in a straightforward manner to other spiking neuron models and provide a systematic analysis of fixed step neural ODE solvers towards an accuracy-computational cost tradeoff.