CoChat

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

The Representation of Prediction Error in Auditory Cortex

Open access
Rubin, Jonathan, Ulanovsky, Nachum, Nelken, Israel, Tishby, Naftali · 2016 · PLOS Computational Biology

Abstract

To survive, organisms must extract information from the past that is relevant for their future. How this process is expressed at the neural level remains unclear. We address this problem by developing a novel approach from first principles. We show here how to generate low-complexity representations of the past that produce optimal predictions of future events. We then illustrate this framework by studying the coding of 'oddball' sequences in auditory cortex. We find that for many neurons in primary auditory cortex, trial-by-trial fluctuations of neuronal responses correlate with the theoretical prediction error calculated from the short-term past of the stimulation sequence, under constraints on the complexity of the representation of this past sequence. In some neurons, the effect of prediction error accounted for more than 50% of response variability. Reliable predictions often depended on a representation of the sequence of the last ten or more stimuli, although the representation kept only few details of that sequence.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1371/journal.pcbi.1005058

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig 1 Information flow between the organism and the environment. The environment consists of a stationary random process. Here the environment produces a Bernoulli sequence of two stimuli. The organism perceives the sequence, summarizing the recent past by a state of a reduced representation (m), then uses m to produce a prediction for the next stimulus in the sequence. Perception is characterized by P(m|past), mapping a sequence of past observations (N = 4 in this illustration) into states m of the reduced representation. In this example, the reduced representation consists of the number of red stimuli among the last N stimuli. Prediction is characterized by P(future|m), which assigns to each state m a set of subjective expectations for the next (future) stimulus. As the number of red stimuli in the past increases, the probability assigned to a red stimulus increases and that assigned to a blue stimulus decreases. The numbers shown here correspond to the posterior probabilities for the corresponding stimulus given a uniform prior on the probability of a red stimulus.
Fig 1 Information flow between the organism and the environment. The environment consists of a stationary random process. Here the environment produces a Bernoulli sequence of two stimuli. The organism perceives the sequence, summarizing the recent past by a state of a reduced representation (m), then uses m to produce a prediction for the next stimulus in the sequence. Perception is characterized by P(m|past), mapping a sequence of past observations (N = 4 in this illustration) into states m of the reduced representation. In this example, the reduced representation consists of the number of red stimuli among the last N stimuli. Prediction is characterized by P(future|m), which assigns to each state m a set of subjective expectations for the next (future) stimulus. As the number of red stimuli in the past increases, the probability assigned to a red stimulus increases and that assigned to a blue stimulus decreases. The numbers shown here correspond to the posterior probabilities for the corresponding stimulus given a uniform prior on the probability of a red stimulus.CC BY · PubMed Central
Fig 2 Reduced representations through the Information Bottleneck method. (a) Illustration of different reduced representations of past sequences in the oddball paradigm (for N = 4 stimuli). Reduced representations are depicted by the conditional probability distribution P(m|past) that maps sequences of observations into states m. (i) The topmost representation maps each possible sequence of N = 4 stimuli to unique state m, resulting in 16 states. (ii) The middle representation is a reduced version, in which sequences with the same number of occurrences of each tone are grouped together resulting in 5 different states. This is the minimal sufficient statistic, and is also the representation illustrated in Fig 1. (iii) The bottom representation with only 3 states results from further constraining the complexity (mutual information between the reduced representation and the past) to 1 bit, and is the optimal representation (with highest predictive power) with that complexity. For this representation, the mapping for past to the state of the representation is probabilistic. (b) The tradeoff between predictive power and complexity of reduced representations in the oddball paradigm for two durations of the past (N = 4 stimuli in gray; N = 10 stimuli in black). Each point along the solid curves shows the complexity (abscissa) and predictive power (ordinate) of one unique solution of the tradeoff, with maximal predictive power for the given complexity and, equivalently, minimal complexity for the given predictive power. The rightmost points correspond to the complexity and predictive power of the full representations that assign a unique state m to each and every possible sequence of N stimuli. Dashed lines connect these values with the points corresponding to the representations based on the minimal sufficient statistic (number of red stimuli). Using the minimal sufficient statistic produces representations that are less complex but provide the same predictive power as the full representations. Further constraints on the complexity result in representations that have lower predictive power. The complexity and predictive power of representation (iii) are shown explicitly on the N = 4 curve: the complexity of this representation is lower than that of the sufficient statistic, and in consequence its predictive power is lower as well. (c) Prediction errors along an oddball sequence calculated using the transformation illustrated in panel a ((i) and (ii), which produce the same prediction errors). In this example, for each stimulus, the preceding four stimuli determine a unique state m of the reduced representation; prediction error is calculated from the predictive distribution using that state m. Bar heights represent the prediction error associated with each stimulus.
Fig 2 Reduced representations through the Information Bottleneck method. (a) Illustration of different reduced representations of past sequences in the oddball paradigm (for N = 4 stimuli). Reduced representations are depicted by the conditional probability distribution P(m|past) that maps sequences of observations into states m. (i) The topmost representation maps each possible sequence of N = 4 stimuli to unique state m, resulting in 16 states. (ii) The middle representation is a reduced version, in which sequences with the same number of occurrences of each tone are grouped together resulting in 5 different states. This is the minimal sufficient statistic, and is also the representation illustrated in Fig 1. (iii) The bottom representation with only 3 states results from further constraining the complexity (mutual information between the reduced representation and the past) to 1 bit, and is the optimal representation (with highest predictive power) with that complexity. For this representation, the mapping for past to the state of the representation is probabilistic. (b) The tradeoff between predictive power and complexity of reduced representations in the oddball paradigm for two durations of the past (N = 4 stimuli in gray; N = 10 stimuli in black). Each point along the solid curves shows the complexity (abscissa) and predictive power (ordinate) of one unique solution of the tradeoff, with maximal predictive power for the given complexity and, equivalently, minimal complexity for the given predictive power. The rightmost points correspond to the complexity and predictive power of the full representations that assign a unique state m to each and every possible sequence of N stimuli. Dashed lines connect these values with the points corresponding to the representations based on the minimal sufficient statistic (number of red stimuli). Using the minimal sufficient statistic produces representations that are less complex but provide the same predictive power as the full representations. Further constraints on the complexity result in representations that have lower predictive power. The complexity and predictive power of representation (iii) are shown explicitly on the N = 4 curve: the complexity of this representation is lower than that of the sufficient statistic, and in consequence its predictive power is lower as well. (c) Prediction errors along an oddball sequence calculated using the transformation illustrated in panel a ((i) and (ii), which produce the same prediction errors). In this example, for each stimulus, the preceding four stimuli determine a unique state m of the reduced representation; prediction error is calculated from the predictive distribution using that state m. Bar heights represent the prediction error associated with each stimulus.CC BY · PubMed Central
Fig 3 Neural responses in the oddball paradigm. (a) Two examples of oddball stimuli blocks, one with p = 10% and the other with p = 90%. Different colors (blue and red) represent the two stimuli (‘low’ and ‘high’ tones of the oddball sequences). (b) Single-neuron responses in cat primary auditory cortex (A1) to auditory oddball stimuli. Each point shows the average spike counts of one neuron to the same stimulus (either low-tone or high-tone, represented by different colors) when presented in the p = 10% block versus the same physical stimulus in the p = 90% block. Note that most dots fall above the diagonal, indicating stronger response to rare stimuli.
Fig 3 Neural responses in the oddball paradigm. (a) Two examples of oddball stimuli blocks, one with p = 10% and the other with p = 90%. Different colors (blue and red) represent the two stimuli (‘low’ and ‘high’ tones of the oddball sequences). (b) Single-neuron responses in cat primary auditory cortex (A1) to auditory oddball stimuli. Each point shows the average spike counts of one neuron to the same stimulus (either low-tone or high-tone, represented by different colors) when presented in the p = 10% block versus the same physical stimulus in the p = 90% block. Note that most dots fall above the diagonal, indicating stronger response to rare stimuli.CC BY · PubMed Central
Fig 4 Tradeoff between complexity and predictive power in the oddball paradigm. (a) Tradeoff curves calculated for different durations of the past sequences, from N = 1 (blue) to N = 50 (red). The curves corresponding to N = 4 and N = 10 are the same as those shown in Fig 2. Each curve spans complexity values from 0 to that of the minimal sufficient statistic. While more complex representations exist, they cannot have higher predictive power. Each point along the curves represents one optimal solution (achieving maximal predictive power for its complexity constraint for the corresponding duration of the past). These curves separate achievable versus non-achievable combinations of complexity and predictive power (below versus above each curve, respectively). (b) The maximal predictive power that can be achieved as a function of the past duration N, for different constraints imposed on the complexity: 0.5 bit (light gray), 1 bits (dark gray), 2 bits (black). The dashed line corresponds to the predictive power of the minimal sufficient statistic, and is therefore the maximal predictive power at each past duration. Note the diminishing returns for increases in memory duration N (i.e. predictive power does not increase much beyond N = 10), as well as for increases in complexity (i.e. predictive power does not increase much beyond a complexity of 2 bits).
Fig 4 Tradeoff between complexity and predictive power in the oddball paradigm. (a) Tradeoff curves calculated for different durations of the past sequences, from N = 1 (blue) to N = 50 (red). The curves corresponding to N = 4 and N = 10 are the same as those shown in Fig 2. Each curve spans complexity values from 0 to that of the minimal sufficient statistic. While more complex representations exist, they cannot have higher predictive power. Each point along the curves represents one optimal solution (achieving maximal predictive power for its complexity constraint for the corresponding duration of the past). These curves separate achievable versus non-achievable combinations of complexity and predictive power (below versus above each curve, respectively). (b) The maximal predictive power that can be achieved as a function of the past duration N, for different constraints imposed on the complexity: 0.5 bit (light gray), 1 bits (dark gray), 2 bits (black). The dashed line corresponds to the predictive power of the minimal sufficient statistic, and is therefore the maximal predictive power at each past duration. Note the diminishing returns for increases in memory duration N (i.e. predictive power does not increase much beyond N = 10), as well as for increases in complexity (i.e. predictive power does not increase much beyond a complexity of 2 bits).CC BY · PubMed Central
Fig 5 Neuronal representation of prediction error in the oddball paradigm. (a) Spike counts of single trial responses of one neuron to one of the two frequencies with which it was tested, plotted as a function of the expected prediction error for the same trial. The prediction errors were computed using optimal reduced representations at three past durations (N = 5, N = 10 and N = 15) with a complexity of 1 bit. A small amount of jitter was added to the x coordinate for visualization purposes only. Colors correspond to the different experimental blocks (p = 10% in red; p = 50% in black; p = 90% in blue). Error bars indicate the mean and the 25th and 75th percentiles for each value of the prediction error. (b) Responses of three different neurons (plotted separately for the two tones, top and bottom panels) as a function of the expected prediction error for a past duration of N = 10 stimuli at a complexity of 2 bits. Responses of the top leftmost panel belong to the same neuron shown in panel a.
Fig 5 Neuronal representation of prediction error in the oddball paradigm. (a) Spike counts of single trial responses of one neuron to one of the two frequencies with which it was tested, plotted as a function of the expected prediction error for the same trial. The prediction errors were computed using optimal reduced representations at three past durations (N = 5, N = 10 and N = 15) with a complexity of 1 bit. A small amount of jitter was added to the x coordinate for visualization purposes only. Colors correspond to the different experimental blocks (p = 10% in red; p = 50% in black; p = 90% in blue). Error bars indicate the mean and the 25th and 75th percentiles for each value of the prediction error. (b) Responses of three different neurons (plotted separately for the two tones, top and bottom panels) as a function of the expected prediction error for a past duration of N = 10 stimuli at a complexity of 2 bits. Responses of the top leftmost panel belong to the same neuron shown in panel a.CC BY · PubMed Central
Fig 6 Population analysis. (a) Histogram of the best goodness-of-fit scores rmax² over the entire population (n = 117 combinations of 68 neurons × 2 test frequencies that evoked significant responses). Significant scores (permutation test, p<0.05; see Methods) are indicated in red (n = 78/117, 67%). (b) Scatter plot of the largest fractions of explained variance achieved for the two frequencies tested with each neuron in the main analysis (n = 68). Neurons with significant rmax² in both tested frequencies are indicated in red while neurons with significant rmax² in only one frequency are indicated in gray. (c) Two-dimensional, color-coded population analysis histograms of the complexity and predictive power underlying the ‘good representations’ (i.e., reduced representations that achieved at least 90% of rmax²). Analysis was performed over combinations of neuron and frequency with rmax²≥0.1 (n = 34/117). Color scale (from blue to red) represents the fraction of neurons for which that combination was ‘good’. An abundance of 100% (red color) means that this combination of parameters was in the ‘good’ set of parameters for each and every neuron in the analyzed population. (d) Same analysis as in panel c, results are shown as a function of past duration and complexity. The 50% contour in the plot is marked by the white line. (e) Same analysis as in panel c, results are shown as a function of past duration and predictive power. Panels d and e use the same color-code as panel c.
Fig 6 Population analysis. (a) Histogram of the best goodness-of-fit scores rmax² over the entire population (n = 117 combinations of 68 neurons × 2 test frequencies that evoked significant responses). Significant scores (permutation test, p<0.05; see Methods) are indicated in red (n = 78/117, 67%). (b) Scatter plot of the largest fractions of explained variance achieved for the two frequencies tested with each neuron in the main analysis (n = 68). Neurons with significant rmax² in both tested frequencies are indicated in red while neurons with significant rmax² in only one frequency are indicated in gray. (c) Two-dimensional, color-coded population analysis histograms of the complexity and predictive power underlying the ‘good representations’ (i.e., reduced representations that achieved at least 90% of rmax²). Analysis was performed over combinations of neuron and frequency with rmax²≥0.1 (n = 34/117). Color scale (from blue to red) represents the fraction of neurons for which that combination was ‘good’. An abundance of 100% (red color) means that this combination of parameters was in the ‘good’ set of parameters for each and every neuron in the analyzed population. (d) Same analysis as in panel c, results are shown as a function of past duration and complexity. The 50% contour in the plot is marked by the white line. (e) Same analysis as in panel c, results are shown as a function of past duration and predictive power. Panels d and e use the same color-code as panel c.CC BY · PubMed Central
Fig 7 Controls and extensions of the main analysis. (a) Comparison of the best goodness-of-fit scores achieved for each combination of neuron and test frequency that had significant response in the ‘equiprobable’ block (p = 50%) and the goodness-of-fit score of the same neuron and frequency in the main analysis (using all responses with p = 10%, 50% and 90%). Significant scores in the equiprobable block are indicated in red (permutation test, p<0.05). (b) Fraction of cases with significant effects of prediction error on the neuronal responses for all the single-block analyses. (c) Fraction of cases with significant effects of prediction error on the neuronal responses in different time windows (marked below the histogram) and for different selection of blocks. (d) Comparison of the fraction of explained variance (rmax²) and the fraction of explainable variance. The red points corresponds to correction by a noise estimates using unbiased variances, while the green points correspond to the conservative correction by the (smaller) noise estimates using the biased variances. (e) Comparison of SSA indices (SI) and explained variance (rmax²). Cases with significant correlation (permutation test, p<0.05) are indicated by blue (low tones) or red (high tones).
Fig 7 Controls and extensions of the main analysis. (a) Comparison of the best goodness-of-fit scores achieved for each combination of neuron and test frequency that had significant response in the ‘equiprobable’ block (p = 50%) and the goodness-of-fit score of the same neuron and frequency in the main analysis (using all responses with p = 10%, 50% and 90%). Significant scores in the equiprobable block are indicated in red (permutation test, p<0.05). (b) Fraction of cases with significant effects of prediction error on the neuronal responses for all the single-block analyses. (c) Fraction of cases with significant effects of prediction error on the neuronal responses in different time windows (marked below the histogram) and for different selection of blocks. (d) Comparison of the fraction of explained variance (rmax²) and the fraction of explainable variance. The red points corresponds to correction by a noise estimates using unbiased variances, while the green points correspond to the conservative correction by the (smaller) noise estimates using the biased variances. (e) Comparison of SSA indices (SI) and explained variance (rmax²). Cases with significant correlation (permutation test, p<0.05) are indicated by blue (low tones) or red (high tones).CC BY · PubMed Central

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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 36 references

Research works printed but not linked: 2

  1. I Nelken, 2014, Stimulus-specific adaptation and deviance detection in the auditory system: experiments and models, Biological cybernetics
  2. M Sahani, 2003, Advnaces in Neural Information Processing System, 15, 109

Cited by

See all 87

Metadata

Authors
Rubin, J., Ulanovsky, N., Nelken, I., & Tishby, N.
Affiliations
  • Hebrew University of Jerusalem (IL)
  • Weizmann Institute of Science (IL)
Corresponding author
Nelken, Israel
Venue
PLOS Computational Biology
Published
2016-08-04
Volume
12
Issue
8
Pages
e1005058
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W2504099198
Cited by
87
References
36
Citations by year
2026: 6 · 2025: 8 · 2024: 5 · 2023: 7 · 2022: 12 · 2021: 8 · 2020: 9 · 2019: 10 · 2018: 10 · 2017: 11 · 2016: 1
FWCI
6.79
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • Gatsby Charitable Foundation
  • Israel Science Foundation
  • Defense Advanced Research Projects Agency
Topics
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neuroscience and Music Perception
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Memory and Neural Mechanisms
Keywords
prediction error, auditory cortex, primary auditory cortex, oddball paradigm, prediction of future events, neural coding, short-term memory
MeSH terms
Animals, Auditory Cortex, Auditory Perception, Cats, Models, Neurological, Neurons, Computational Biology

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: The Representation of Prediction Error in Auditory Cortex. https://app.cochat.ai/papers/10.1371/journal.pcbi.1005058
The paper
Rubin, J., Ulanovsky, N., Nelken, I., & Tishby, N. (2016). The Representation of Prediction Error in Auditory Cortex. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1005058

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.