Neuronal adaptation translates stimulus gaps into a population code.
Neurons in sensory pathways exhibit a vast multitude of adaptation behaviors, which are assumed to aid the encoding of temporal stimulus features and provide the basis for a population code in higher brain areas. Here we study the transition to a population code for auditory gap stimuli both in neur...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2014-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0095705&type=printable |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Neurons in sensory pathways exhibit a vast multitude of adaptation behaviors, which are assumed to aid the encoding of temporal stimulus features and provide the basis for a population code in higher brain areas. Here we study the transition to a population code for auditory gap stimuli both in neurophysiological recordings and in a computational network model. Independent component analysis (ICA) of experimental data from the inferior colliculus of Mongolian gerbils reveals that the network encodes different gap sizes primarily with its population firing rate within 30 ms after the presentation of the gap, where longer gap size evokes higher network activity. We then developed a computational model to investigate possible mechanisms of how to generate the population code for gaps. Phenomenological (ICA) and functional (discrimination performance) analyses of our simulated networks show that the experimentally observed patterns may result from heterogeneous adaptation, where adaptation provides gap detection at the single neuron level and neuronal heterogeneity ensures discriminable population codes for the whole range of gap sizes in the input. Furthermore, our work suggests that network recurrence additionally enhances the network's ability to provide discriminable population patterns. |
|---|---|
| ISSN: | 1932-6203 |