MétaCan
Menu
Back to cohort
Record W2025257504 · doi:10.1109/icaie.2010.5641154

Self-Directed Learner

2010· article· en· W2025257504 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Algorithms
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer scienceArtificial intelligenceExploitProcess (computing)Sequence (biology)Machine learningSimple (philosophy)Instance-based learningAutodidacticismActive learning (machine learning)Mathematics educationProgramming languageMathematics

Abstract

fetched live from OpenAlex

Traditional supervised learning algorithms choose labeled training examples in a given sequence passively. However, in many real-world situations, a learner can choose which training example to learn, and its goal is to minimize the number of mistakes that the learner currently predicts for such training examples. In this paper, we propose a simple yet effective human-oriented supervised learning paradigm, Self-Directed Learner (SDL), which explicitly exploits a human learning strategy to solve this problem. SDL chooses the example that is predicted with the most certain label to learn and updates its model gradually. We conduct the experiments on a well-known educational software with both our learning algorithm and human beings. The experiment results show that HOL is able to minimize the number of mistakes efficiently. In addition, it models the human learning process much better than other learning algorithms.

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.

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.768
Threshold uncertainty score0.649

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.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.004
GPT teacher head0.224
Teacher spread0.220 · 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

Quick stats

Citations3
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and AlgorithmsFrench-language works237,207