UNIGE document Scientific Article
previous document  unige:24940  next document
add to browser collection
Title

Insights from a simple expression for linear fisher information in a recurrently connected population of spiking neurons

Authors
Beck, Jeffrey
Bejjanki, Vikranth R
Published in Neural Computation. 2011, vol. 23, no. 6, p. 1484-502
Abstract A simple expression for a lower bound of Fisher information is derived for a network of recurrently connected spiking neurons that have been driven to a noise-perturbed steady state. We call this lower bound linear Fisher information, as it corresponds to the Fisher information that can be recovered by a locally optimal linear estimator. Unlike recent similar calculations, the approach used here includes the effects of nonlinear gain functions and correlated input noise and yields a surprisingly simple and intuitive expression that offers substantial insight into the sources of information degradation across successive layers of a neural network. Here, this expression is used to (1) compute the optimal (i.e., information-maximizing) firing rate of a neuron, (2) demonstrate why sharpening tuning curves by either thresholding or the action of recurrent connectivity is generally a bad idea, (3) show how a single cortical expansion is sufficient to instantiate a redundant population code that can propagate across multiple cortical layers with minimal information loss, and (4) show that optimal recurrent connectivity strongly depends on the covariance structure of the inputs to the network.
Keywords Action Potentials/physiologyModels, NeurologicalNerve Net/physiologyNeural Networks (Computer)Neurons/physiology
Identifiers
PMID: 21395435
Full text
Article (Published version) (358 Kb) - public document Free access
Structures
Research group Groupe Alexandre Pouget (938)
Citation
(ISO format)
BECK, Jeffrey, BEJJANKI, Vikranth R, POUGET, Alexandre. Insights from a simple expression for linear fisher information in a recurrently connected population of spiking neurons. In: Neural Computation, 2011, vol. 23, n° 6, p. 1484-502. https://archive-ouverte.unige.ch/unige:24940

266 hits

309 downloads

Update

Deposited on : 2013-01-03

Export document
Format :
Citation style :