Mastery Guided Non-parametric Clustering to Scale-up Strategy Prediction

• URL: http://arxiv.org/abs/2401.10210v1
• Date: Thu, 4 Jan 2024 17:57:21 GMT
• Title: Mastery Guided Non-parametric Clustering to Scale-up Strategy Prediction
• Authors: Anup Shakya, Vasile Rus, Deepak Venugopal
• Abstract summary: We learn a representation based on Node2Vec that encodes symmetries over mastery or skill level. We apply our model to learn strategies for Math learning from large-scale datasets from MATHia.
• Score: 1.1049608786515839
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Predicting the strategy (sequence of concepts) that a student is likely to use in problem-solving helps Adaptive Instructional Systems (AISs) better adapt themselves to different types of learners based on their learning abilities. This can lead to a more dynamic, engaging, and personalized experience for students. To scale up training a prediction model (such as LSTMs) over large-scale education datasets, we develop a non-parametric approach to cluster symmetric instances in the data. Specifically, we learn a representation based on Node2Vec that encodes symmetries over mastery or skill level since, to solve a problem, it is natural that a student's strategy is likely to involve concepts in which they have gained mastery. Using this representation, we use DP-Means to group symmetric instances through a coarse-to-fine refinement of the clusters. We apply our model to learn strategies for Math learning from large-scale datasets from MATHia, a leading AIS for middle-school math learning. Our results illustrate that our approach can consistently achieve high accuracy using a small sample that is representative of the full dataset. Further, we show that this approach helps us learn strategies with high accuracy for students at different skill levels, i.e., leveraging symmetries improves fairness in the prediction model.

Related papers

• What Do Learning Dynamics Reveal About Generalization in LLM Reasoning? [83.83230167222852]
  We find that a model's generalization behavior can be effectively characterized by a training metric we call pre-memorization train accuracy. By connecting a model's learning behavior to its generalization, pre-memorization train accuracy can guide targeted improvements to training strategies.
  arXiv  Detail & Related papers  (2024-11-12T09:52:40Z)
• Uncertainty Aware Learning for Language Model Alignment [97.36361196793929]
  We propose uncertainty-aware learning (UAL) to improve the model alignment of different task scenarios. We implement UAL in a simple fashion -- adaptively setting the label smoothing value of training according to the uncertainty of individual samples. Experiments on widely used benchmarks demonstrate that our UAL significantly and consistently outperforms standard supervised fine-tuning.
  arXiv  Detail & Related papers  (2024-06-07T11:37:45Z)
• Curriculum Learning for Graph Neural Networks: Which Edges Should We Learn First [13.37867275976255]
  We propose a novel strategy to incorporate more edges into training according to their difficulty from easy to hard. We demonstrate the strength of our proposed method in improving the generalization ability and robustness of learned representations.
  arXiv  Detail & Related papers  (2023-10-28T15:35:34Z)
• Anonymous Learning via Look-Alike Clustering: A Precise Analysis of Model Generalization [18.03833857491361]
  A common approach to enhancing privacy involves training models using anonymous data rather than individual data. We provide an analysis of how training models using anonymous cluster centers affects their generalization capabilities. In certain high-dimensional regimes, training over anonymous cluster centers acts as a regularization and improves generalization error of the trained models.
  arXiv  Detail & Related papers  (2023-10-06T04:52:46Z)
• Scalable and Equitable Math Problem Solving Strategy Prediction in Big Educational Data [2.86829428083307]
  We develop an embedding called MVec where we learn a representation based on the mastery of students. We then cluster these embeddings with a non-parametric clustering method. We show that our approach can scale up to achieve high accuracy by training on a small sample of a large dataset.
  arXiv  Detail & Related papers  (2023-08-07T19:51:10Z)
• GraphLearner: Graph Node Clustering with Fully Learnable Augmentation [76.63963385662426]
  Contrastive deep graph clustering (CDGC) leverages the power of contrastive learning to group nodes into different clusters. We propose a Graph Node Clustering with Fully Learnable Augmentation, termed GraphLearner. It introduces learnable augmentors to generate high-quality and task-specific augmented samples for CDGC.
  arXiv  Detail & Related papers  (2022-12-07T10:19:39Z)
• The Geometry of Self-supervised Learning Models and its Impact on Transfer Learning [62.601681746034956]
  Self-supervised learning (SSL) has emerged as a desirable paradigm in computer vision. We propose a data-driven geometric strategy to analyze different SSL models using local neighborhoods in the feature space induced by each.
  arXiv  Detail & Related papers  (2022-09-18T18:15:38Z)
• A Survey of Learning on Small Data: Generalization, Optimization, and Challenge [101.27154181792567]
  Learning on small data that approximates the generalization ability of big data is one of the ultimate purposes of AI. This survey follows the active sampling theory under a PAC framework to analyze the generalization error and label complexity of learning on small data. Multiple data applications that may benefit from efficient small data representation are surveyed.
  arXiv  Detail & Related papers  (2022-07-29T02:34:19Z)
• Self-Supervised Class Incremental Learning [51.62542103481908]
  Existing Class Incremental Learning (CIL) methods are based on a supervised classification framework sensitive to data labels. When updating them based on the new class data, they suffer from catastrophic forgetting: the model cannot discern old class data clearly from the new. In this paper, we explore the performance of Self-Supervised representation learning in Class Incremental Learning (SSCIL) for the first time.
  arXiv  Detail & Related papers  (2021-11-18T06:58:19Z)
• A Primal-Dual Subgradient Approachfor Fair Meta Learning [23.65344558042896]
  Few shot meta-learning is well-known with its fast-adapted capability and accuracy generalization onto unseen tasks. We propose a Primal-Dual Fair Meta-learning framework, namely PDFM, which learns to train fair machine learning models using only a few examples.
  arXiv  Detail & Related papers  (2020-09-26T19:47:38Z)

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.