ABSTRACT
A major goal of computational neuroscience is to build accurate models of the activity of neurons that can be used to interpret their function in circuits. Here, we explore using functional cell types to refine single-cell models by grouping them into functionally relevant classes. Formally, we define a hierarchical generative model for cell types, single-cell parameters, and neural responses, and then derive an expectation-maximization algorithm with variational inference that maximizes the likelihood of the neural recordings. We apply this "simultaneous" method to estimate cell types and fit single-cell models from simulated data, and find that it accurately recovers the ground truth parameters. We then apply our approach to in vitro neural recordings from neurons in mouse primary visual cortex, and find that it yields improved prediction of single-cell activity. We demonstrate that the discovered cell-type clusters are well separated and generalizable, and thus amenable to interpretation. We then compare discovered cluster memberships with locational, morphological, and transcriptomic data. Our findings reveal the potential to improve models of neural responses by explicitly allowing for shared functional properties across neurons.
Subject(s)
Algorithms , Neurons , Mice , Animals , Computer Simulation , Neurons/physiology , Probability , Models, Neurological , Action Potentials/physiologyABSTRACT
A major goal of computational neuroscience is to build accurate models of the activity of neurons that can be used to interpret their function in circuits. Here, we explore using functional cell types to refine single-cell models by grouping them into functionally relevant classes. Formally, we define a hierarchical generative model for cell types, single-cell parameters, and neural responses, and then derive an expectation-maximization algorithm with variational inference that maximizes the likelihood of the neural recordings. We apply this "simultaneous" method to estimate cell types and fit single-cell models from simulated data, and find that it accurately recovers the ground truth parameters. We then apply our approach to in vitro neural recordings from neurons in mouse primary visual cortex, and find that it yields improved prediction of single-cell activity. We demonstrate that the discovered cell-type clusters are well separated and generalizable, and thus amenable to interpretation. We then compare discovered cluster memberships with locational, morphological, and transcriptomic data. Our findings reveal the potential to improve models of neural responses by explicitly allowing for shared functional properties across neurons.
ABSTRACT
Neural circuits are structured with layers of converging and diverging connectivity and selectivity-inducing nonlinearities at neurons and synapses. These components have the potential to hamper an accurate encoding of the circuit inputs. Past computational studies have optimized the nonlinearities of single neurons, or connection weights in networks, to maximize encoded information, but have not grappled with the simultaneous impact of convergent circuit structure and nonlinear response functions for efficient coding. Our approach is to compare model circuits with different combinations of convergence, divergence, and nonlinear neurons to discover how interactions between these components affect coding efficiency. We find that a convergent circuit with divergent parallel pathways can encode more information with nonlinear subunits than with linear subunits, despite the compressive loss induced by the convergence and the nonlinearities when considered separately.
Subject(s)
Models, Neurological , Nonlinear Dynamics , Retina/physiology , Synapses/physiology , Synaptic Transmission , Visual Pathways/physiology , HumansABSTRACT
While spike timing has been shown to carry detailed stimulus information at the sensory periphery, its possible role in network computation is less clear. Most models of computation by neural networks are based on population firing rates. In equivalent spiking implementations, firing is assumed to be random such that averaging across populations of neurons recovers the rate-based approach. Recently, however, Denéve and colleagues have suggested that the spiking behavior of neurons may be fundamental to how neuronal networks compute, with precise spike timing determined by each neuron's contribution to producing the desired output (Boerlin and Denéve, 2011; Boerlin et al., 2013). By postulating that each neuron fires to reduce the error in the network's output, it was demonstrated that linear computations can be performed by networks of integrate-and-fire neurons that communicate through instantaneous synapses. This left open, however, the possibility that realistic networks, with conductance-based neurons with subthreshold nonlinearity and the slower timescales of biophysical synapses, may not fit into this framework. Here, we show how the spike-based approach can be extended to biophysically plausible networks. We then show that our network reproduces a number of key features of cortical networks including irregular and Poisson-like spike times and a tight balance between excitation and inhibition. Lastly, we discuss how the behavior of our model scales with network size or with the number of neurons "recorded" from a larger computing network. These results significantly increase the biological plausibility of the spike-based approach to network computation. SIGNIFICANCE STATEMENT: We derive a network of neurons with standard spike-generating currents and synapses with realistic timescales that computes based upon the principle that the precise timing of each spike is important for the computation. We then show that our network reproduces a number of key features of cortical networks including irregular, Poisson-like spike times, and a tight balance between excitation and inhibition. These results significantly increase the biological plausibility of the spike-based approach to network computation, and uncover how several components of biological networks may work together to efficiently carry out computation.
Subject(s)
Action Potentials/physiology , Biophysical Phenomena/physiology , Models, Neurological , Nerve Net/physiology , Neural Networks, Computer , Neurons/physiology , Animals , Biophysics , Computer Simulation , Synapses/physiologyABSTRACT
Two atmospheric circulation systems, the mid-latitude Westerlies and the Asian summer monsoon (ASM), play key roles in northern-hemisphere climatic changes. However, the variability of the Westerlies in Asia and their relationship to the ASM remain unclear. Here, we present the longest and highest-resolution drill core from Lake Qinghai on the northeastern Tibetan Plateau (TP), which uniquely records the variability of both the Westerlies and the ASM since 32 ka, reflecting the interplay of these two systems. These records document the anti-phase relationship of the Westerlies and the ASM for both glacial-interglacial and glacial millennial timescales. During the last glaciation, the influence of the Westerlies dominated; prominent dust-rich intervals, correlated with Heinrich events, reflect intensified Westerlies linked to northern high-latitude climate. During the Holocene, the dominant ASM circulation, punctuated by weak events, indicates linkages of the ASM to orbital forcing, North Atlantic abrupt events, and perhaps solar activity changes.
ABSTRACT
In choice reaction time tasks, response times and error rates demonstrate differential dependencies on the identities of up to four stimuli preceding the current one. Although the general profile of reaction times and error rates, when plotted against the stimulus histories, may seem idiosyncratic, we show that it can result from simple underlying mechanisms that take account of the occurrence of stimulus repetitions and alternations. Employing a simple connectionist model of a two-alternative forced-choice task, we explored various combinations of repetition and alternation detection schemes in an attempt to account for empirical results from the literature and from our own studies. We found that certain combinations of the repetition and the alternation schemes provided good fits to the data, suggesting that simple mechanisms may serve to explain the complicated but highly reproducible higher order dependencies of task performance on stimulus history.