MétaCan
Menu
Back to cohort
Record W3126336315 · doi:10.22215/etd/2019-13888

Clarifying metacognition through computational modelling

2019· dissertation· en· W3126336315 on OpenAlexaff
Brendan Conway-Smith

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicIntelligent Tutoring Systems and Adaptive Learning
Canadian institutionsCarleton University
Fundersnot available
KeywordsMetacognitionCognitionTerminologyCognitive scienceCognitive architectureCognitive psychologyAbstractionPsychologyComputer scienceEpistemologyNeuroscience

Abstract

fetched live from OpenAlex

This thesis presents a novel method of modelling metacognition computationally.Metacognition is commonly described as cognition acting on itself, and is correlated with enhanced performance in memory, reasoning, emotional regulation, and motor skills.How it attains these effects remains unclear.Understanding the mechanisms of metacognition requires surmounting two barrriers: the subject's highlevel abstraction and disputed terminology.To overcome these obstacle, and to clarify the workings of metacognition this thesis employs a computational cognitive architecture to define the base units of cognition, and how they come to act on themselves.Well-defined computational units are built upon to form increasing complex metacognitive processes.These computational forms of metacognition are then connected to the research literature.Finally, each form of metacognition is built into working models within the cognitive architecture ACT-R.These working models serve as an existence proof of the models' viability and functionality.The intention of this thesis is to help clarify the nature of metacognition, its underlying mechanisms, and its implications for advancing a unified theory of metacognition.

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.006
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: none
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0030.005
Open science0.0020.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.001

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.052
GPT teacher head0.287
Teacher spread0.235 · 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
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicIntelligent Tutoring Systems and Adaptive LearningFrench-language works237,207