Monthly
288 pp. per issue, 6 x 9,
illustrated
Founded: 1989
ISSN 0899-7667
E-ISSN 1530-888X
2008 ISI Impact Factor: 2.378
|
February 2007, Vol. 19, No. 2, Pages 404-441
Posted Online January 5, 2007.
(doi:10.1162/neco.2007.19.2.404)
© 2007 Massachusetts Institute of Technology
Fast Population Coding Quentin J. M. HuysGatsby Computational Neuroscience Unit, University College London, London WC1N 3AR, U.K., qhuys@cantab.net Richard S. ZemelDepartment of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3H5, zemel@cs.toronto.edu Rama NatarajanDepartment of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3H5, rama@cs.toronto.edu Peter DayanGatsby Computational Neuroscience Unit, University College London, London WC1N 3AR, U.K., dayan@gatsby.ucl.ac.uk
Uncertainty coming from the noise in its neurons and the ill-posed nature of many tasks plagues neural computations. Maybe surprisingly, many studies show that the brain manipulates these forms of uncertainty in a probabilistically consistent and normative manner, and there is now a rich theoretical literature on the capabilities of populations of neurons to implement computations in the face of uncertainty. However, one major facet of uncertainty has received comparatively little attention: time. In a dynamic, rapidly changing world, data are only temporarily relevant. Here, we analyze the computational consequences of encoding stimulus trajectories in populations of neurons. For the most obvious, simple, instantaneous encoder, the correlations induced by natural, smooth stimuli engender a decoder that requires access to information that is nonlocal both in time and across neurons. This formally amounts to a ruinous representation. We show that there is an alternative encoder that is computationally and representationally powerful in which each spike contributes independent information; it is independently decodable, in other words. We suggest this as an appropriate foundation for understanding time-varying population codes. Furthermore, we show how adaptation to temporal stimulus statistics emerges directly from the demands of simple decoding. Cited byOmer Bobrowski, Ron Meir, Yonina C. Eldar. (2009) Bayesian Filtering in Spiking Neural Networks: Noise, Adaptation, and Multisensory Integration. Neural Computation 21:5, 1277-1320 Online publication date: 1-May-2009. Abstract
| Full Text
| PDF (1080 KB)
| PDF Plus (491 KB) Aurel A. Lazar, Eftychios A. Pnevmatikakis. (2008) Faithful Representation of Stimuli with a Population of Integrate-and-Fire Neurons. Neural Computation 20:11, 2715-2744 Online publication date: 1-Nov-2008. Abstract
| PDF (1152 KB)
| PDF Plus (874 KB) Rama Natarajan, Quentin J. M. Huys, Peter Dayan, Richard S. Zemel. (2008) Encoding and Decoding Spikes for Dynamic Stimuli. Neural Computation 20:9, 2325-2360 Online publication date: 1-Sep-2008. Abstract
| PDF (2462 KB)
| PDF Plus (539 KB) Sophie Deneve. (2008) Bayesian Spiking Neurons I: Inference. Neural Computation 20:1, 91-117 Online publication date: 1-Jan-2008. Abstract
| PDF (368 KB)
| PDF Plus (403 KB)
|