MétaCan
Menu
Back to cohort

A Decision-Theoretic Tutor for Analogical Problem Solving

2011· book-chapter· en· W2485519559 on OpenAlexaff
Kasia Müldner, Cristina Conati

Bibliographic record

VenueIGI Global eBooks · 2011
Typebook-chapter
Languageen
FieldComputer Science
TopicIntelligent Tutoring Systems and Adaptive Learning
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsTUTORSelection (genetic algorithm)Computer scienceMechanism (biology)Probabilistic logicArtificial intelligenceProcess (computing)Decision problemBayesian networkMachine learningManagement scienceEngineeringAlgorithm

Abstract

fetched live from OpenAlex

We describe a decision-theoretic tutor that helps students learn from Analogical Problem Solving (APS), i.e., from problem-solving activities that involve worked-out examples. This tutor incorporates an innovative example-selection mechanism that tailors the choice of example to a given student so as to trigger studying behaviors that are known to foster learning. The mechanism relies on a two-phase decision-theoretic process, as follows. First, a probabilistic user model corresponding to a dynamic Bayesian network simulates how a given student will use an example to solve a problem and what she will learn from doing so. Second, this simulation is quantified via an expected utility calculation, enabling the tutor to select the example with the highest expected utility for maximizing learning and problem-solving outcomes. Once an example is presented to a student, the user model generates an assessment of the student’s APS, enabling the selection mechanism to have up to date information on the student. Our empirical evaluation shows that this selection mechanism is more effective than standard selection approaches for fostering learning from APS. Here, we provide a comprehensive technical description of the example-selection mechanism, as well as an overview of its evaluation and a discussion of some of the challenges related to our decision-theoretic approach.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.280
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.033
GPT teacher head0.254
Teacher spread0.221 · 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.

Study designTheoretical or conceptual
Domainnot available
GenreOther

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

Citations2
Published2011
Admission routes1
Has abstractyes

Explore more

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