A Generalized Apprenticeship Learning Framework for Modeling Heterogeneous Student Pedagogical Strategies

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Islam, Md Mirajul, Yang, Xi, Hostetter, John, Saha, Adittya Soukarjya, Chi, Min
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910472062631936
author Islam, Md Mirajul
Yang, Xi
Hostetter, John
Saha, Adittya Soukarjya
Chi, Min
author_facet Islam, Md Mirajul
Yang, Xi
Hostetter, John
Saha, Adittya Soukarjya
Chi, Min
contents A key challenge in e-learning environments like Intelligent Tutoring Systems (ITSs) is to induce effective pedagogical policies efficiently. While Deep Reinforcement Learning (DRL) often suffers from sample inefficiency and reward function design difficulty, Apprenticeship Learning(AL) algorithms can overcome them. However, most AL algorithms can not handle heterogeneity as they assume all demonstrations are generated with a homogeneous policy driven by a single reward function. Still, some AL algorithms which consider heterogeneity, often can not generalize to large continuous state space and only work with discrete states. In this paper, we propose an expectation-maximization(EM)-EDM, a general AL framework to induce effective pedagogical policies from given optimal or near-optimal demonstrations, which are assumed to be driven by heterogeneous reward functions. We compare the effectiveness of the policies induced by our proposed EM-EDM against four AL-based baselines and two policies induced by DRL on two different but related tasks that involve pedagogical action prediction. Our overall results showed that, for both tasks, EM-EDM outperforms the four AL baselines across all performance metrics and the two DRL baselines. This suggests that EM-EDM can effectively model complex student pedagogical decision-making processes through the ability to manage a large, continuous state space and adapt to handle diverse and heterogeneous reward functions with very few given demonstrations.
format Preprint
id arxiv_https___arxiv_org_abs_2406_02450
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Generalized Apprenticeship Learning Framework for Modeling Heterogeneous Student Pedagogical Strategies
Islam, Md Mirajul
Yang, Xi
Hostetter, John
Saha, Adittya Soukarjya
Chi, Min
Machine Learning
Artificial Intelligence
A key challenge in e-learning environments like Intelligent Tutoring Systems (ITSs) is to induce effective pedagogical policies efficiently. While Deep Reinforcement Learning (DRL) often suffers from sample inefficiency and reward function design difficulty, Apprenticeship Learning(AL) algorithms can overcome them. However, most AL algorithms can not handle heterogeneity as they assume all demonstrations are generated with a homogeneous policy driven by a single reward function. Still, some AL algorithms which consider heterogeneity, often can not generalize to large continuous state space and only work with discrete states. In this paper, we propose an expectation-maximization(EM)-EDM, a general AL framework to induce effective pedagogical policies from given optimal or near-optimal demonstrations, which are assumed to be driven by heterogeneous reward functions. We compare the effectiveness of the policies induced by our proposed EM-EDM against four AL-based baselines and two policies induced by DRL on two different but related tasks that involve pedagogical action prediction. Our overall results showed that, for both tasks, EM-EDM outperforms the four AL baselines across all performance metrics and the two DRL baselines. This suggests that EM-EDM can effectively model complex student pedagogical decision-making processes through the ability to manage a large, continuous state space and adapt to handle diverse and heterogeneous reward functions with very few given demonstrations.
title A Generalized Apprenticeship Learning Framework for Modeling Heterogeneous Student Pedagogical Strategies
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2406.02450