Search bioRxivSearch

Biology subjects

Kushnir, L.

Publications and source records attributed to Kushnir, L..

2 recordsLinked to original sources

A distributed neural code in ensembles of dentate gyrus granule cells

The tuning properties of neurons in a given brain region have been traditionally viewed as the under-pinnings of computation in neural circuits. However, at the higher levels of processing, specialization is often elusive, instead a mix of sensory, cognitive and behavioural quantities drive neural activity. In such networks, ensembles of neurons, rather than single units with easily interpretable tuning properties, encode behaviourally relevant variables. Here we show that this is the case also in the dentate gyrus and CA1 subregions of the hippocampus. Using calcium imaging in freely moving mice, we decoded the instantaneous position, direction of motion and speed from the activity of hundreds of cells in the hippocampus of mice freely exploring an arena. For the vast majority of neurons in both regions, their response properties were not predictive of their importance for encoding position. Furthermore, we could decode position from populations of cells that were important for decoding direction of motion and vice versa, showing that these quantities are encoded by largely overlapping ensembles as in distributed neural code. Finally, we found that correlated activities had an impact on decoding performance in CA1 but not in dentate gyrus, suggesting different enconding strategies for these areas. Our analysis indicates that classical methods of analysis based on single cell response properties might be insufficient to accurately characterize the neural computation in a given area. In contrast, population analysis may help highlight previously overlooked properties of hippocampal circuits.

neuroscience

Classifiers with limited connectivity

For many neural network models in which neurons are trained to classify inputs like perceptrons, the number of inputs that can be classified is limited by the connectivity of each neuron, even when the total number of neurons is very large. This poses the problem of how the biological brain can take advantage of its huge number of neurons given that the connectivity is sparse. One solution is to combine multiple perceptrons together, as in committee machines. The number of classifiable random patterns would then grow linearly with the number of perceptrons, even when each perceptron has limited connectivity. However, the problem is moved to the downstream readout neurons, which would need a number of connections that is as large as the number of perceptrons. Here we propose a different approach in which the readout is implemented by connecting multiple perceptrons in a recurrent attractor neural network. We prove analytically that the number of classifiable random patterns can grow unboundedly with the number of perceptrons, even when the connectivity of each perceptron remains finite. Most importantly, both the recurrent connectivity and the connectivity of downstream readouts also remain finite. Our study shows that feed-forward neural classifiers with numerous long range afferent connections can be replaced by recurrent networks with sparse long range connectivity without sacrificing the classification performance. Our strategy could be used to design more general scalable network architectures with limited connectivity, which resemble more closely the brain neural circuits which are dominated by recurrent connectivity.

neuroscience