Narrow Results

This paper discusses research frontiers of membrane computing by presenting current open problems and research topics, together with the relevant background and motivation.

Classification and sequence learning are relevant capabilities used by living beings to extract complex information from the environment for behavioral control. The insect world is full of examples where the presentation time of specific stimuli shapes the behavioral response. On the basis of previously developed neural models, inspired by Drosophila melanogaster, a new architecture for classification and sequence learning is here presented under the perspective of the Neural Reuse theory. Classification of relevant input stimuli is performed through resonant neurons, activated by the complex dynamics generated in a lattice of recurrent spiking neurons modeling the insect Mushroom Bodies neuropile. The network devoted to context formation is able to reconstruct the learned sequence and also to trace the subsequences present in the provided input. A sensitivity analysis to parameter variation and noise is reported. Experiments on a roving robot are reported to show the capabilities of the architecture used as a neural controller.

This study introduces a novel learning algorithm for spiking neurons, called CCDS, which is able to learn and reproduce arbitrary spike patterns in a supervised fashion allowing the processing of spatiotemporal information encoded in the precise timing of spikes. Unlike the Remote Supervised Method (ReSuMe), synapse delays and axonal delays in CCDS are variants which are modulated together with weights during learning. The CCDS rule is both biologically plausible and computationally efficient. The properties of this learning rule are investigated extensively through experimental evaluations in terms of reliability, adaptive learning performance, generality to different neuron models, learning in the presence of noise, effects of its learning parameters and classification performance. Results presented show that the CCDS learning method achieves learning accuracy and learning speed comparable with ReSuMe, but improves classification accuracy when compared to both the Spike Pattern Association Neuron (SPAN) learning rule and the Tempotron learning rule. The merit of CCDS rule is further validated on a practical example involving the automated detection of interictal spikes in EEG records of patients with epilepsy. Results again show that with proper encoding, the CCDS rule achieves good recognition performance.

It is clear that the topological structure of a neural network somehow determines the activity of the neurons within it. In the present work, we ask to what extent it is possible to examine the structural features of a network and learn something about its activity? Specifically, we consider how the centrality (the importance of a node in a network) of a neuron correlates with its firing rate. To investigate, we apply an array of centrality measures, including In-Degree, Closeness, Betweenness, Eigenvector, Katz, PageRank, Hyperlink-Induced Topic Search (HITS) and NeuronRank to Leaky-Integrate and Fire neural networks with different connectivity schemes. We find that Katz centrality is the best predictor of firing rate given the network structure, with almost perfect correlation in all cases studied, which include purely excitatory and excitatory–inhibitory networks, with either homogeneous connections or a small-world structure. We identify the properties of a network which will cause this correlation to hold. We argue that the reason Katz centrality correlates so highly with neuronal activity compared to other centrality measures is because it nicely captures disinhibition in neural networks. In addition, we argue that these theoretical findings are applicable to neuroscientists who apply centrality measures to functional brain networks, as well as offer a neurophysiological justification to high level cognitive models which use certain centrality measures.

We consider a system of N spiking neurons with random synaptic connections which take values ±1 with equal probability. The resulting system of equations has a stationary solution equal to 1 for the fraction of neurons having potential x at time t. This solution describes an asynchronous state. We study the stability of such a state in a perturbative way and find a threshold for the parameters of the model such that for values larger than this threshold the stationary asynchronous state is stable otherwise it is unstable. In other terms the stability of the asynchronous state holds only for relatively small random perturbations.

Application of comparison theorem is used to examine the validitiy of the "lumped parameter assumption" in describing the behavior of solutions of the continuous cable equation U_t = DU_xx+f(U) with the discrete cable equation dV_n/dt = d*(V_n+1 - 2V_n + V_n-1) + f(V_n), where f is a nonlinear functional describing the internal diffusion of electrical potential in single neurons. While the discrete cable equation looks like a finite difference approximation of the continuous cable equation, solutions of the two reveal significantly different behavior which imply that the compartmental models (spiking neurons) are poor quantifiers of neurons, contrary to what is commonly accepted in computational neuroscience.

Unlike traditional artificial neural networks (ANNs), which use a high abstraction of real neurons, spiking neural networks (SNNs) offer a biologically plausible model of realistic neurons. They differ from classical artificial neural networks in that SNNs handle and communicate information by means of timing of individual pulses, an important feature of neuronal systems being ignored by models based on rate coding scheme. However, in order to make the most of these realistic neuronal models, good training algorithms are required. Most existing learning paradigms tune the synaptic weights in an unsupervised way using an adaptation of the famous Hebbian learning rule, which is based on the correlation between the pre- and post-synaptic neurons activity. Nonetheless, supervised learning is more appropriate when prior knowledge about the outcome of the network is available. In this paper, a new approach for supervised training is presented with a biologically plausible architecture. An adapted evolutionary strategy (ES) is used for adjusting the synaptic strengths and delays, which underlie the learning and memory processes in the nervous system. The algorithm is applied to complex non-linearly separable problems, and the results show that the network is able to perform learning successfully by means of temporal encoding of presented patterns.