HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Huys, Q. J. M. Articles by Dayan, P. Search for Related Content PubMed Articles by Huys, Q. J. M. Articles by Dayan, P.

Fast Population Coding

qhuys{at}cantab.net Gatsby Computational Neuroscience Unit, University College London, London WC1N 3AR, U.K.

Richard S. Zemel

zemel{at}cs.toronto.edu Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3H5

Rama Natarajan

rama{at}cs.toronto.edu Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3H5

Peter Dayan

dayan{at}gatsby.ucl.ac.uk Gatsby Computational Neuroscience Unit, University College London, London WC1N 3AR, U.K.

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.

This article has been cited by other articles:

				S. Deneve Bayesian Spiking Neurons I: Inference Neural Comput., January 1, 2007; 20(1): 91 - 117. [Abstract] [Full Text] [PDF]