%0 Conference Paper %1 Prihar_2022 %A Prihar, Ethan %A Haim, Aaron %A Sales, Adam %A Heffernan, Neil %B Proceedings of the Ninth ACM Conference on Learning @ Scale %D 2022 %I ACM %K e-learning las2022 recommender transparency %P 1-11 %R 10.1145/3491140.3528267 %T Automatic Interpretable Personalized Learning %U https://doi.org/10.1145%2F3491140.3528267 %X Personalized learning stems from the idea that students benefit from instructional material tailored to their needs. Many online learning platforms purport to implement some form of personalized learning, often through on-demand tutoring or self-paced instruction, but to our knowledge none have a way to automatically explore for specific opportunities to personalize students' education nor a transparent way to identify the effects of personalization on specific groups of students. In this work we present the Automatic Personalized Learning Service (APLS). The APLS uses multi-armed bandit algorithms to recommend the most effective support to each student that requests assistance when completing their online work, and is currently used by ASSISTments, an online learning platform. The first empirical study of the APLS found that Beta-Bernoulli Thompson Sampling, a popular and effective multi-armed bandit algorithm, was only slightly more capable of selecting helpful support than randomly selecting from the relevant support options. Therefore, we also present Decision Tree Thompson Sampling (DTTS), a novel contextual multi-armed bandit algorithm that integrates the transparency and interpretability of decision trees into Thomson sampling. In simulation, DTTS overcame the challenges of recommending support within an online learning platform and was able to increase students' learning by as much as 10% more than the current algorithm used by the APLS. We demonstrate that DTTS is able to identify qualitative interactions that not only help determine the most effective support for students, but that also generalize well to new students, problems, and support content. The APLS using DTTS is now being deployed at scale within ASSISTments and is a promising tool for all educational learning platforms.

@inproceedings{Prihar_2022, abstract = {Personalized learning stems from the idea that students benefit from instructional material tailored to their needs. Many online learning platforms purport to implement some form of personalized learning, often through on-demand tutoring or self-paced instruction, but to our knowledge none have a way to automatically explore for specific opportunities to personalize students' education nor a transparent way to identify the effects of personalization on specific groups of students. In this work we present the Automatic Personalized Learning Service (APLS). The APLS uses multi-armed bandit algorithms to recommend the most effective support to each student that requests assistance when completing their online work, and is currently used by ASSISTments, an online learning platform. The first empirical study of the APLS found that Beta-Bernoulli Thompson Sampling, a popular and effective multi-armed bandit algorithm, was only slightly more capable of selecting helpful support than randomly selecting from the relevant support options. Therefore, we also present Decision Tree Thompson Sampling (DTTS), a novel contextual multi-armed bandit algorithm that integrates the transparency and interpretability of decision trees into Thomson sampling. In simulation, DTTS overcame the challenges of recommending support within an online learning platform and was able to increase students' learning by as much as 10% more than the current algorithm used by the APLS. We demonstrate that DTTS is able to identify qualitative interactions that not only help determine the most effective support for students, but that also generalize well to new students, problems, and support content. The APLS using DTTS is now being deployed at scale within ASSISTments and is a promising tool for all educational learning platforms.}, added-at = {2022-06-07T00:44:11.000+0200}, author = {Prihar, Ethan and Haim, Aaron and Sales, Adam and Heffernan, Neil}, biburl = {https://www.bibsonomy.org/bibtex/2c72968e3c0a6b9f780de64b52eb8b699/brusilovsky}, booktitle = {Proceedings of the Ninth {ACM} Conference on Learning @ Scale}, description = {Automatic Interpretable Personalized Learning | Proceedings of the Ninth ACM Conference on Learning @ Scale}, doi = {10.1145/3491140.3528267}, interhash = {7dfe3cd252ff0230e09db0059879744b}, intrahash = {c72968e3c0a6b9f780de64b52eb8b699}, keywords = {e-learning las2022 recommender transparency}, month = jun, pages = {1-11}, publisher = {{ACM}}, timestamp = {2022-06-07T00:44:11.000+0200}, title = {Automatic Interpretable Personalized Learning}, url = {https://doi.org/10.1145%2F3491140.3528267}, year = 2022 }