MétaCan
Menu
Back to cohort
Record W2808883319 · doi:10.14288/1.0371125

Statistical Learning Creates Novel Object Associations via Transitive Relations

2018· article· en· W2808883319 on OpenAlexaff
Yu Luo

Bibliographic record

VenueeScholarship (California Digital Library) · 2018
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsTransitive relationComputer scienceObject (grammar)Statistical learningBasis (linear algebra)Artificial intelligenceCognitive scienceStatistical inferenceCognitionMechanism (biology)Machine learningCognitive psychologyPsychologyMathematicsEpistemologyNeuroscienceStatistics

Abstract

fetched live from OpenAlex

A remarkable ability of the cognitive system is to make novel inferences on the basis of prior experiences. What mechanism supports such inferences? We propose that statistical learning is a process through which transitive inferences of new associations are made between objects that have never been directly associated. After viewing a continuous sequence containing two base pairs (e.g., A–B, B–C), participants automatically inferred a transitive pair (e.g., A–C) where the two objects had never co-occurred before (Experiment 1). This transitive inference occurred in the absence of explicit awareness of the base pairs. However, participants failed to infer the transitive pair from three base pairs (Experiment 2), showing the limits of the transitive inference (Experiment 3). We further demonstrated that this transitive inference can operate across the categorical hierarchy (Experiments 4–7). The findings revealed a novel consequence of statistical learning in which new transitive associations between objects are implicitly inferred.

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.001
metaresearch head score (Gemma)0.013
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.013
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.002
Scholarly communication0.0010.005
Open science0.0010.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.000

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.014
GPT teacher head0.228
Teacher spread0.214 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueeScholarship (California Digital Library)Same topicNeural Networks and ApplicationsFrench-language works237,207