Optimizing Mastery Learning by Fast-Forwarding Over-Practice Steps

• URL: http://arxiv.org/abs/2506.17577v1
• Date: Sat, 21 Jun 2025 04:14:26 GMT
• Title: Optimizing Mastery Learning by Fast-Forwarding Over-Practice Steps
• Abstract summary: Fast-Forwarding can reduce overpractice by up to one-third.<n>It does not require students to complete problem-solving steps if all remaining pathways are fully mastered.<n>While Fast-Forwarding may improve student practice efficiency, the size of its practical impact may also depend on students' ability to stay motivated.
• Score: 8.654776900490965
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• DARE: Difficulty-Adaptive Reinforcement Learning with Co-Evolved Difficulty Estimation [45.9370934377402]
  Reinforcement learning improves the reasoning ability of large language models but remains costly and sample-inefficient.<n>We propose **Dare**, a framework that co-evolves difficulty estimation with the policy via self-normalized importance sampling.<n>Experiments across multiple models and domains demonstrate that **Dare** consistently outperforms existing methods in training efficiency, final effectiveness, and inference efficiency.
  arXiv  Detail & Related papers  (2026-05-09T22:05:59Z)
• Understanding Student Effort Using Response-Time Propensities During Problem Solving [4.227790869947882]
  Effort during multi-step problem solving is rarely directly observed.<n>Step-to-step response time as a scalable effort signal.<n>Response-time propensities show moderate to strong stability within students.
  arXiv  Detail & Related papers  (2026-05-09T13:27:15Z)
• Sequencing to Mitigate Catastrophic Forgetting in Continual Learning [1.1724961392643483]
  Catastrophic forgetting (CF) is a major challenge to the progress of Continual Learning approaches.<n>We consider the role of task sequencing in mitigating CF and propose a method for determining the optimal task order.<n>Results demonstrate that intelligent task sequencing can substantially reduce CF.
  arXiv  Detail & Related papers  (2025-12-18T18:40:58Z)
• Search-Based Adversarial Estimates for Improving Sample Efficiency in Off-Policy Reinforcement Learning [0.0]
  We propose to use Adversarial Estimates as a new, simple and efficient approach to mitigate this problem.<n>Our approach leverages latent similarity search from a small set of human-collected trajectories to boost learning.<n>The results of our study show algorithms trained with Adversarial Estimates converge faster than their original version.
  arXiv  Detail & Related papers  (2025-02-03T17:41:02Z)
• BloomWise: Enhancing Problem-Solving capabilities of Large Language Models using Bloom's-Taxonomy-Inspired Prompts [59.83547898874152]
  We introduce BloomWise, a new prompting technique, inspired by Bloom's taxonomy, to improve the performance of Large Language Models (LLMs) The decision regarding the need to employ more sophisticated cognitive skills is based on self-evaluation performed by the LLM. In extensive experiments across 4 popular math reasoning datasets, we have demonstrated the effectiveness of our proposed approach.
  arXiv  Detail & Related papers  (2024-10-05T09:27:52Z)
• Towards Robust Continual Learning with Bayesian Adaptive Moment Regularization [51.34904967046097]
  Continual learning seeks to overcome the challenge of catastrophic forgetting, where a model forgets previously learnt information. We introduce a novel prior-based method that better constrains parameter growth, reducing catastrophic forgetting. Results show that BAdam achieves state-of-the-art performance for prior-based methods on challenging single-headed class-incremental experiments.
  arXiv  Detail & Related papers  (2023-09-15T17:10:51Z)
• Human-Inspired Framework to Accelerate Reinforcement Learning [1.6317061277457001]
  Reinforcement learning (RL) is crucial for data science decision-making but suffers from sample inefficiency. This paper introduces a novel human-inspired framework to enhance RL algorithm sample efficiency.
  arXiv  Detail & Related papers  (2023-02-28T13:15:04Z)
• Reusable Options through Gradient-based Meta Learning [24.59017394648942]
  Several deep learning approaches were proposed to learn temporal abstractions in the form of options in an end-to-end manner. We frame the problem of learning options as a gradient-based meta-learning problem. We show that our method is able to learn transferable components which accelerate learning and performs better than existing prior methods.
  arXiv  Detail & Related papers  (2022-12-22T14:19:35Z)
• Teacher-student curriculum learning for reinforcement learning [1.7259824817932292]
  Reinforcement learning (rl) is a popular paradigm for sequential decision making problems. The sample inefficiency of deep reinforcement learning methods is a significant obstacle when applying rl to real-world problems. We propose a teacher-student curriculum learning setting where we simultaneously train a teacher that selects tasks for the student while the student learns how to solve the selected task.
  arXiv  Detail & Related papers  (2022-10-31T14:45:39Z)
• Learning to Optimize Permutation Flow Shop Scheduling via Graph-based Imitation Learning [70.65666982566655]
  Permutation flow shop scheduling (PFSS) is widely used in manufacturing systems. We propose to train the model via expert-driven imitation learning, which accelerates convergence more stably and accurately. Our model's network parameters are reduced to only 37% of theirs, and the solution gap of our model towards the expert solutions decreases from 6.8% to 1.3% on average.
  arXiv  Detail & Related papers  (2022-10-31T09:46:26Z)
• Planning for Sample Efficient Imitation Learning [52.44953015011569]
  Current imitation algorithms struggle to achieve high performance and high in-environment sample efficiency simultaneously. We propose EfficientImitate, a planning-based imitation learning method that can achieve high in-environment sample efficiency and performance simultaneously. Experimental results show that EI achieves state-of-the-art results in performance and sample efficiency.
  arXiv  Detail & Related papers  (2022-10-18T05:19:26Z)
• Improving Human Sequential Decision-Making with Reinforcement Learning [29.334511328067777]
  We design a novel machine learning algorithm that is capable of extracting "best practices" from trace data. Our algorithm selects the tip that best bridges the gap between the actions taken by human workers and those taken by the optimal policy. Experiments show that the tips generated by our algorithm can significantly improve human performance.
  arXiv  Detail & Related papers  (2021-08-19T02:57:58Z)
• Low-Regret Active learning [64.36270166907788]
  We develop an online learning algorithm for identifying unlabeled data points that are most informative for training. At the core of our work is an efficient algorithm for sleeping experts that is tailored to achieve low regret on predictable (easy) instances.
  arXiv  Detail & Related papers  (2021-04-06T22:53:45Z)
• Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
  This paper investigates the classical integer least-squares problem which estimates signals integer from linear models. The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning. We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
  arXiv  Detail & Related papers  (2021-01-07T08:00:02Z)
• Mastering Rate based Curriculum Learning [78.45222238426246]
  We argue that the notion of learning progress itself has several shortcomings that lead to a low sample efficiency for the learner. We propose a new algorithm, based on the notion of mastering rate, that significantly outperforms learning progress-based algorithms.
  arXiv  Detail & Related papers  (2020-08-14T16:34:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.