Optimizing Mastery Learning by Fast-Forwarding Over-Practice Steps
Not on the map. Why?
Abstract (arXiv)
Mastery learning improves learning proficiency and efficiency. However, the overpractice of skills--students spending time on skills they have already mastered--remains a fundamental challenge for tutoring systems. Previous research has reduced overpractice through the development of better problem selection algorithms and the authoring of focused practice tasks. However, few efforts have concentrated on reducing overpractice through step-level adaptivity, which can avoid resource-intensive curriculum redesign. We propose and evaluate Fast-Forwarding as a technique that enhances existing problem selection algorithms. Based on simulation studies informed by learner models and problem-solving pathways derived from real student data, Fast-Forwarding can reduce overpractice by up to one-third, as it does not require students to complete problem-solving steps if all remaining pathways are fully mastered. Fast-Forwarding is a flexible method that enhances any problem selection algorithm, though its effectiveness is highest for algorithms that preferentially select difficult problems. Therefore, our findings suggest that while Fast-Forwarding may improve student practice efficiency, the size of its practical impact may also depend on students' ability to stay motivated and engaged at higher levels of difficulty.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 4 of its 41 references that are in the map. First posted on arXiv 21 Jun 2025.
Builds on
4 of 41 references.
References · 4
- 2015Deep Knowledge Tracingcited by 332
- 2020SAINT+: Integrating Temporal Features for EdNet Correctness Predictioncited by 57
- 20243DG: A Framework for Using Generative AI for Handling Sparse Learner Performance Data From Intelligent Tutoring Systemscited by 9
- 2025An Integrated Platform for Studying Learning with Intelligent Tutoring Systems: CTAT+TutorShopcited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.