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 Similar articles in PubMed 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 Bethge, M. Articles by Pawelzik, K. Search for Related Content PubMed PubMed Citation Articles by Bethge, M. Articles by Pawelzik, K.

Optimal Short-Term Population Coding: When Fisher Information Fails

mbethge{at}physik.uni-bremen.de, Institute of Theoretical Physics, University of Bremen, Bremen, D-28334 Germany

D. Rotermund

davrot{at}physik.uni-bremen.de, Institute of Theoretical Physics, University of Bremen, Bremen, D-28334 Germany

K. Pawelzik

pawelzik{at}physik.uni-bremen.de, Institute of Theoretical Physics, University of Bremen, Bremen, D-28334 Germany

Efficient coding has been proposed as a first principle explaining neuronal response properties in the central nervous system. The shape of optimal codes, however, strongly depends on the natural limitations of the particular physical system. Here we investigate how optimal neuronal encoding strategies are influenced by the finite number of neurons N (place constraint), the limited decoding time window length T (time constraint), the maximum neuronal firing rate f_max (power constraint), and the maximal average rate f_max (energy constraint). While Fisher information provides a general lower bound for the mean squared error of unbiased signal reconstruction, its use to characterize the coding precision is limited. Analyzing simple examples, we illustrate some typical pitfalls and thereby show that Fisher information provides a valid measure for the precision of a code only if the dynamic range (f_minT, f_maxT) is sufficiently large. In particular, we demonstrate that the optimal width of gaussian tuning curves depends on the available decoding time T. Within the broader class of unimodal tuning functions, it turns out that the shape of a Fisher-optimal coding scheme is not unique. We solve this ambiguity by taking the minimum mean square error into account, which leads to flat tuning curves. The tuning width, however, remains to be determined by energy constraints rather than by the principle of efficient coding.

This article has been cited by other articles:

				W. M. Brown and A. Backer Optimal Neuronal Tuning for Finite Stimulus Spaces Neural Comput., July 1, 2006; 18(7): 1511 - 1526. [Abstract] [Full Text] [PDF]

				S. Wu and S.-i. Amari Computing with Continuous Attractors: Stability and Online Aspects Neural Comput., October 1, 2005; 17(10): 2215 - 2239. [Abstract] [Full Text] [PDF]

				P. Lansky and P. E. Greenwood Optimal Signal Estimation in Neuronal Models Neural Comput., October 1, 2005; 17(10): 2240 - 2257. [Abstract] [Full Text] [PDF]