Optimal Hierarchical Learning Path Design With Reinforcement Learning

  title={Optimal Hierarchical Learning Path Design With Reinforcement Learning},
  author={Xiao Li and Hanchen Xu and Jinming Zhang and Hua-hua Chang},
  journal={Applied Psychological Measurement},
  pages={54 - 70}
E-learning systems are capable of providing more adaptive and efficient learning experiences for learners than traditional classroom settings. A key component of such systems is the learning policy. The learning policy is an algorithm that designs the learning paths or rather it selects learning materials for learners based on information such as the learners’ current progresses and skills, learning material contents. In this article, the authors address the problem of finding the optimal… Expand
Deep Reinforcement Learning for Adaptive Learning Systems
A model-free deep reinforcement learning algorithm is applied that can effectively find the optimal learning policy from data on learners' learning process without knowing the actual transition model of the learners' continuous latent traits. Expand


A reinforcement learning approach to personalized learning recommendation systems
A reinforcement learning approach is proposed to solve the problem of personalized learning within the Markov decision framework and achieves a balance between making the best possible recommendations based on the current knowledge and exploring new learning trajectories that may potentially pay off. Expand
Reinforcement Learning: An Introduction
This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications. Expand
Recommendation System for Adaptive Learning
A mathematical framework is proposed that characterizes the recommendation process as a Markov decision problem, for which decisions are made based on the current knowledge of the learner and that of the learning materials. Expand
Reinforcement Learning: A Survey
Central issues of reinforcement learning are discussed, including trading off exploration and exploitation, establishing the foundations of the field via Markov decision theory, learning from delayed reinforcement, constructing empirical models to accelerate learning, making use of generalization and hierarchy, and coping with hidden state. Expand
Contextual multi-armed bandit algorithms for personalized learning action selection
This paper proposes three new Bayesian policies to select personalized learning actions for students that each exhibits advantages over prior work, and experimentally validate them using real-world datasets. Expand
Issues in Using Function Approximation for Reinforcement Learning
This paper gives a theoretical account of the phenomenon, deriving conditions under which one may expected it to cause learning to fail, and presents experimental results which support the theoretical findings. Expand
Knowledge tracing: Modeling the acquisition of procedural knowledge
An effort to model students' changing knowledge state during skill acquisition and a series of studies is reviewed that examine the empirical validity of knowledge tracing and has led to modifications in the process. Expand
Tracking Skill Acquisition With Cognitive Diagnosis Models: A Higher-Order, Hidden Markov Model With Covariates
The results show the potential application of the proposed model to track the change of students’ skills directly and provide immediate remediation as well as to evaluate the efficacy of different interventions by investigating how different types of learning interventions impact the transitions from nonmastery to mastery. Expand
A Hidden Markov Model for Learning Trajectories in Cognitive Diagnosis With Application to Spatial Rotation Skills
The authors focus on the development of Bayesian procedures for estimating parameters of a first-order hidden Markov model and an application of the developed model to a spatial rotation experimental intervention. Expand
Markov Games as a Framework for Multi-Agent Reinforcement Learning
A Q-learning-like algorithm for finding optimal policies and its application to a simple two-player game in which the optimal policy is probabilistic is demonstrated. Expand