Deep Reinforcement Learning For Adaptive Learning Systems

Abstract

In this paper, we formulate the adaptive learning problem---the problem of how to find an individualized learning plan (called policy) that chooses the most appropriate learning materials based on learner's latent traits---faced in adaptive learning systems as a Markov decision process (MDP). We assume latent traits to be continuous with an unknown transition model. We apply a model-free deep reinforcement learning algorithm---the deep Q-learning algorithm---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. To efficiently utilize available data, we also develop a transition model estimator that emulates the learner's learning process using neural networks. The transition model estimator can be used in the deep Q-learning algorithm so that it can more efficiently discover the optimal learning policy for a learner. Numerical simulation studies verify that the

Stats

• citations46
• S2 citations—
• github stars0
• HF likes0
• heat score12.54
• arxiv keyli2020deep

Related papers

• Minimum-delay Adaptation In Non-stationary Reinforcement Learning Via Online High-confidence Change-point Detection (2021)0.00
• Deep Reinforcement Learning Policies Learn Shared Adversarial Features Across Mdps (2021)6.77
• Learning A Subspace Of Policies For Online Adaptation In Reinforcement Learning (2021)0.00
• Reinforcement Learning: A Comparison Of UCB Versus Alternative Adaptive Policies (2019)0.00
• Multi-timescale Ensemble Q-learning For Markov Decision Process Policy Optimization (2024)6.34
• Policy Learning With Adaptively Collected Data (2021)0.00
• Reinforcement Learning For Individual Optimal Policy From Heterogeneous Data (2025)0.00
• A General Markov Decision Process Framework For Directly Learning Optimal Control Policies (2019)0.00