MétaCan
Menu
Back to cohort
Record W197205934

A Measure of Relatedness for Selecting Consolidated Task Knowledge.

2005· article· en· W197205934 on OpenAlexaff
Daniel Silver, Richard Alisch

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsAcadia University
Fundersnot available
KeywordsTask (project management)Computer scienceArtificial intelligenceGeneralizationMeasure (data warehouse)Artificial neural networkTransfer of learningContext (archaeology)Task analysisCosine similaritySimilarity measureRepresentation (politics)Machine learningPattern recognition (psychology)MathematicsData mining
DOInot available

Abstract

fetched live from OpenAlex

The selective transfer of task knowledge is studied within the context of multiple task learning (MTL) neural networks. Given a consolidated MTL network of previously learned tasks and a new primary task, T0, a measure of task relatedness is derived. The existing consolidated MTL network representation is xed and an output for task T0 is connected to the hidden nodes of the network and trained. The cosine similarity be-tween the hidden to output weight vectors for T0 and the weight vectors for each of the previously learned tasks is used as measure of task relatedness. The most re-lated tasks are then used to learn T0 within a new MTL network using the task rehearsal method. Results of an empirical study on two synthetic domains of invariant concept tasks demonstrate the method's ability to selec-tively transfer knowledge from the most related tasks so as to develop hypotheses with superior generalization.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score0.190

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.021
GPT teacher head0.280
Teacher spread0.259 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations5
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicNeural Networks and ApplicationsFrench-language works237,207