Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 263

The DOI matches its OpenAlex record; 37 of the 37 references it cites were found in a registry or an index.

Characterizing the sparseness of neural codes

Ben D. B. Willmore, D.J. Tolhurst·2001·Network Computation in Neural Systems

Abstract

It is often suggested that efficient neural codes for natural visual information should be 'sparse'. However, the term 'sparse' has been used in two different ways--firstly to describe codes in which few neurons are active at any time ('population sparseness'), and secondly to describe codes in which each neuron's lifetime response distribution has high kurtosis ('lifetime sparseness'). Although these ideas are related, they are not identical, and the most common measure of lifetime sparseness--the kurtosis of the lifetime response distributions of the neurons--provides no information about population sparseness. We have measured the population sparseness and lifetime kurtosis of several biologically inspired coding schemes. We used three measures of population sparseness (population kurtosis, Treves-Rolls sparseness and 'activity sparseness'), and found them to be in close agreement with one another. However, we also measured the lifetime kurtosis of the cells in each code. We found that lifetime kurtosis is uncorrelated with population sparseness for the codes we used. Lifetime kurtosis is not, therefore, a useful measure of the population sparseness of a code. Moreover, the Gabor-like codes, which are often assumed to have high population sparseness (since they have high lifetime kurtosis), actually turned out to have rather low population sparseness. Surprisingly, principal components filters produced the codes with the highest population sparseness.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

OpenAlex · 10.1088/0954-898x/12/3/302

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 37 references

Cited by

See all 263

Metadata

Authors
Willmore, B. D. B., & Tolhurst, D. J.
Venue
Network Computation in Neural Systems
Publisher
Taylor & Francis
Published
2001-03-01
Volume
12
Issue
3
Pages
255-270
ISSN
0954-898X (ISSN-L)
OpenAlex
W2100449221
Cited by
263
References
37
FWCI
2.51
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Characterizing the sparseness of neural codes. https://app.cochat.ai/papers/10.1088/0954-898x/12/3/302
The paper
Willmore, B. D. B., & Tolhurst, D. J. (2001). Characterizing the sparseness of neural codes. Network Computation in Neural Systems. https://doi.org/10.1088/0954-898x/12/3/302

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.