MétaCan
Menu
Back to cohort
Record W3098565106 · doi:10.22215/etd/2018-12958

A Comparison of Case-Based Reasoning and Probabilistic Graphical Models in the Context of Learning from Observation

2018· dissertation· en· W3098565106 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
Typedissertation
Languageen
FieldComputer Science
TopicAI-based Problem Solving and Planning
Canadian institutionsCarleton University
Fundersnot available
KeywordsArtificial intelligenceComputer scienceMachine learningGraphical modelProbabilistic logicClassifier (UML)Domain (mathematical analysis)Case-based reasoningMathematics

Abstract

fetched live from OpenAlex

Learning from observation is a technique whereby learning occurs through observation or experience. In this work, we compare two existing techniques of learning from observation: Probabilistic Graphical Models (PGM) and Case-Based Reasoning (CBR) with the goal of identifying a preferred approach for future improvement. We show that the Naive Bayes Classifier is better than a previously used PGM model in learning behavior in a vacuum cleaner domain and introduce a state-based retrieval technique in CBR and show that there is no once-size-fits-all approach to learn state-based behavior. We also compare the two learning techniques in fully and partially observable continuous domains, namely Cartpole V0, obstacle avoidance, and 2D RoboCup. We show that the CBR approach works best in Cartpole V0, the PGM approach works best in obstacle avoidance, and the PGM approach works best in 2D RoboCup. Ultimately, we show that the preferred technique is generally behavior and domain specific. i

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.001
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.854
Threshold uncertainty score0.551

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.057
GPT teacher head0.301
Teacher spread0.244 · 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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicAI-based Problem Solving and PlanningFrench-language works237,207