Combining Difficulty Ranking with Multi-Armed Bandits to Sequence Educational Content

04/14/2018
by   Avi Segal, et al.
0

As e-learning systems become more prevalent, there is a growing need for them to accommodate individual differences between students. This paper addresses the problem of how to personalize educational content to students in order to maximize their learning gains over time. We present a new computational approach to this problem called MAPLE (Multi-Armed Bandits based Personalization for Learning Environments) that combines difficulty ranking with multi-armed bandits. Given a set of target questions MAPLE estimates the expected learning gains for each question and uses an exploration-exploitation strategy to choose the next question to pose to the student. It maintains a personalized ranking over the difficulties of question in the target set which is used in two ways: First, to obtain initial estimates over the learning gains for the set of questions. Second, to update the estimates over time based on the students responses. We show in simulations that MAPLE was able to improve students' learning gains compared to approaches that sequence questions in increasing level of difficulty, or rely on content experts. When implemented in a live e-learning system in the wild, MAPLE showed promising results. This work demonstrates the efficacy of using stochastic approaches to the sequencing problem when augmented with information about question difficulty.

READ FULL TEXT

page 7

page 8

research
07/28/2019

A difficulty ranking approach to personalization in E-learning

The prevalence of e-learning systems and on-line courses has made educat...
research
08/10/2022

Increasing Students' Engagement to Reminder Emails Through Multi-Armed Bandits

Conducting randomized experiments in education settings raises the quest...
research
04/12/2017

Value Directed Exploration in Multi-Armed Bandits with Structured Priors

Multi-armed bandits are a quintessential machine learning problem requir...
research
10/12/2015

Context-Aware Bandits

We propose an efficient Context-Aware clustering of Bandits (CAB) algori...
research
06/23/2016

Adaptive Task Assignment in Online Learning Environments

With the increasing popularity of online learning, intelligent tutoring ...
research
01/21/2020

R2DE: a NLP approach to estimating IRT parameters of newly generated questions

The main objective of exams consists in performing an assessment of stud...
research
12/18/2014

Tag-Aware Ordinal Sparse Factor Analysis for Learning and Content Analytics

Machine learning offers novel ways and means to design personalized lear...

Please sign up or login with your details

Forgot password? Click here to reset