Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Wu, S.
Right arrow Articles by Nakahara, H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Wu, S.
Right arrow Articles by Nakahara, H.
(Neural Computation. 2002;14:999-1026.)
© 2002 The MIT Press


Letter

Population Coding and Decoding in a Neural Field: A Computational Study

Si Wu

s.wu{at}dcs.ac.uk, RIKEN Brain Science Institute, Wako-shi, Saitama, Japan, and Department of Computer Science, Sheffield University, U.K.

Shun-ichi Amari

amari{at}brain.riken.go.jp, RIKEN Brain Science Institute, Wako-shi, Saitama, Japan

Hiroyuki Nakahara

hiro{at}brain.riken.go.jp, RIKEN Brain Science Institute, Wako-shi, Saitama, Japan, and Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan

This study uses a neural field model to investigate computational aspects of population coding and decoding when the stimulus is a single variable. A general prototype model for the encoding process is proposed, in which neural responses are correlated, with strength specified by a gaussian function of their difference in preferred stimuli. Based on the model, we study the effect of correlation on the Fisher information, compare the performances of three decoding methods that differ in the amount of encoding information being used, and investigate the implementation of the three methods by using a recurrent network. This study not only rediscovers main results in existing literatures in a unified way, but also reveals important new features, especially when the neural correlation is strong. As the neural correlation of firing becomes larger, the Fisher information decreases drastically. We confirm that as the width of correlation increases, the Fisher information saturates and no longer increases in proportion to the number of neurons. However, we prove that as the width increases further—wider than times the effective width of the turning function—the Fisher information increases again, and it increases without limit in proportion to the number of neurons. Furthermore, we clarify the asymptotic efficiency of the maximum likelihood inference (MLI) type of decoding methods for correlated neural signals. It shows that when the correlation covers a nonlocal range of population (excepting the uniform correlation and when the noise is extremely small), the MLI type of method, whose decoding error satisfies the Cauchy-type distribution, is not asymptotically efficient. This implies that the variance is no longer adequate to measure decoding accuracy.




This article has been cited by other articles:


Home page
Neural Comput.Home page
S. Wu, K. Hamaguchi, and S.-i. Amari
Dynamics and Computation of Continuous Attractors
Neural Comput., April 1, 2007; 20(4): 994 - 1025.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
F. Klam, R. S. Zemel, and A. Pouget
Population Coding with Motion Energy Filters: The Impact of Correlations
Neural Comput., January 1, 2007; 20(1): 146 - 175.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
M. Shamir and H. Sompolinsky
Implications of Neuronal Diversity on Population Coding
Neural Comput., August 1, 2006; 18(8): 1951 - 1986.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
S.-i. Amari, H. Park, and T. Ozeki
Singularities affect dynamics of learning in neuromanifolds.
Neural Comput., May 1, 2006; 18(5): 1007 - 1065.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
K. Hamaguchi, M. Okada, M. Yamana, and K. Aihara
Correlated Firing in a Feedforward Network with Mexican-Hat-Type Connectivity
Neural Comput., September 1, 2005; 17(9): 2034 - 2059.
[Abstract] [Full Text] [PDF]


Home page
J. Neurosci.Home page
P. E. Latham and S. Nirenberg
Synergy, Redundancy, and Independence in Population Codes, Revisited
J. Neurosci., May 25, 2005; 25(21): 5195 - 5206.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S.-i. Amari and H. Nakahara
Difficulty of Singularity in Population Coding
Neural Comput., April 1, 2005; 17(4): 839 - 858.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S. Wu, D. Chen, M. Niranjan, and S.-i. Amari
Sequential Bayesian Decoding with a Population of Neurons
Neural Comput., May 1, 2003; 15(5): 993 - 1012.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2002 by The MIT Press.