MétaCan
Menu
Back to cohort
Record W2951877485 · doi:10.1371/journal.pcbi.1005508

Representational models: A common framework for understanding encoding, pattern-component, and representational-similarity analysis

2017· article· en· W2951877485 on OpenAlexafffund
Jörn Diedrichsen, Nikolaus Kriegeskorte

Bibliographic record

VenuePLoS Computational Biology · 2017
Typearticle
Languageen
FieldNeuroscience
TopicFace Recognition and Perception
Canadian institutionsWestern University
FundersNatural Sciences and Engineering Research Council of CanadaJames S. McDonnell Foundation
KeywordsComponent (thermodynamics)Similarity (geometry)Computer scienceComputational biologyEvolutionary biologyArtificial intelligenceBiology

Abstract

fetched live from OpenAlex

Representational models specify how activity patterns in populations of neurons (or, more generally, in multivariate brain-activity measurements) relate to sensory stimuli, motor responses, or cognitive processes. In an experimental context, representational models can be defined as hypotheses about the distribution of activity profiles across experimental conditions. Currently, three different methods are being used to test such hypotheses: encoding analysis, pattern component modeling (PCM), and representational similarity analysis (RSA). Here we develop a common mathematical framework for understanding the relationship of these three methods, which share one core commonality: all three evaluate the second moment of the distribution of activity profiles, which determines the representational geometry, and thus how well any feature can be decoded from population activity. Using simulated data for three different experimental designs, we compare the power of the methods to adjudicate between competing representational models. PCM implements a likelihood-ratio test and therefore provides the most powerful test if its assumptions hold. However, the other two approaches-when conducted appropriately-can perform similarly. In encoding analysis, the linear model needs to be appropriately regularized, which effectively imposes a prior on the activity profiles. With such a prior, an encoding model specifies a well-defined distribution of activity profiles. In RSA, the unequal variances and statistical dependencies of the dissimilarity estimates need to be taken into account to reach near-optimal power in inference. The three methods render different aspects of the information explicit (e.g. single-response tuning in encoding analysis and population-response representational dissimilarity in RSA) and have specific advantages in terms of computational demands, ease of use, and extensibility. The three methods are properly construed as complementary components of a single data-analytical toolkit for understanding neural representations on the basis of multivariate brain-activity data.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.016
metaresearch head score (Gemma)0.032
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.016
Threshold uncertainty score0.087

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.032
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0030.006
Bibliometrics0.0070.005
Science and technology studies0.0010.011
Scholarly communication0.0110.016
Open science0.0090.005
Research integrity0.0050.008
Insufficient payload (model declined to judge)0.0060.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.350
GPT teacher head0.413
Teacher spread0.063 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations357
Published2017
Admission routes2
Has abstractyes

Explore more

Same venuePLoS Computational BiologySame topicFace Recognition and PerceptionFrench-language works237,207