Finding Similar Exercises in Retrieval Manner

• URL: http://arxiv.org/abs/2303.11163v1
• Date: Wed, 15 Mar 2023 01:40:32 GMT
• Title: Finding Similar Exercises in Retrieval Manner
• Authors: Tongwen Huang, Xihua Li, Chao Yi, Xuemin Zhao, Yunbo Cao
• Abstract summary: How to find similar exercises for a given exercise becomes a crucial technical problem. We define similar exercises'' as a retrieval process of finding a set of similar exercises based on recall, ranking and re-rank procedures. comprehensive representation of the semantic information of exercises was obtained through representation learning.
• Score: 11.694650259195756
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: When students make a mistake in an exercise, they can consolidate it by ``similar exercises'' which have the same concepts, purposes and methods. Commonly, for a certain subject and study stage, the size of the exercise bank is in the range of millions to even tens of millions, how to find similar exercises for a given exercise becomes a crucial technical problem. Generally, we can assign a variety of explicit labels to the exercise, and then query through the labels, but the label annotation is time-consuming, laborious and costly, with limited precision and granularity, so it is not feasible. In practice, we define ``similar exercises'' as a retrieval process of finding a set of similar exercises based on recall, ranking and re-rank procedures, called the \textbf{FSE} problem (Finding similar exercises). Furthermore, comprehensive representation of the semantic information of exercises was obtained through representation learning. In addition to the reasonable architecture, we also explore what kind of tasks are more conducive to the learning of exercise semantic information from pre-training and supervised learning. It is difficult to annotate similar exercises and the annotation consistency among experts is low. Therefore this paper also provides solutions to solve the problem of low-quality annotated data. Compared with other methods, this paper has obvious advantages in both architecture rationality and algorithm precision, which now serves the daily teaching of hundreds of schools.

Related papers

• Intelligent Repetition Counting for Unseen Exercises: A Few-Shot Learning Approach with Sensor Signals [0.4998632546280975]
  This study develops a method to automatically count exercise repetitions by analyzing IMU signals. We propose a repetition counting technique utilizing a deep metric-based few-shot learning approach. We show an 86.8% probability of accurately counting ten or more repetitions within a single set across 28 different exercises.
  arXiv  Detail & Related papers  (2024-10-01T05:04:40Z)
• Resilient Constrained Learning [94.27081585149836]
  This paper presents a constrained learning approach that adapts the requirements while simultaneously solving the learning task. We call this approach resilient constrained learning after the term used to describe ecological systems that adapt to disruptions by modifying their operation.
  arXiv  Detail & Related papers  (2023-06-04T18:14:18Z)
• Learning Context-aware Classifier for Semantic Segmentation [88.88198210948426]
  In this paper, contextual hints are exploited via learning a context-aware classifier. Our method is model-agnostic and can be easily applied to generic segmentation models. With only negligible additional parameters and +2% inference time, decent performance gain has been achieved on both small and large models.
  arXiv  Detail & Related papers  (2023-03-21T07:00:35Z)
• An Empirical Study of Finding Similar Exercises [0.0]
  We release a Chinese education pre-trained language model BERT$_Edu$ for the label-scarce dataset. We propose a very effective MoE enhanced multi-task model for FSE task to attain better understanding of exercises.
  arXiv  Detail & Related papers  (2021-11-16T09:39:14Z)
• Co$^2$L: Contrastive Continual Learning [69.46643497220586]
  Recent breakthroughs in self-supervised learning show that such algorithms learn visual representations that can be transferred better to unseen tasks. We propose a rehearsal-based continual learning algorithm that focuses on continually learning and maintaining transferable representations.
  arXiv  Detail & Related papers  (2021-06-28T06:14:38Z)
• 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)
• Few-shot Sequence Learning with Transformers [79.87875859408955]
  Few-shot algorithms aim at learning new tasks provided only a handful of training examples. In this work we investigate few-shot learning in the setting where the data points are sequences of tokens. We propose an efficient learning algorithm based on Transformers.
  arXiv  Detail & Related papers  (2020-12-17T12:30:38Z)
• Learning to Actively Learn: A Robust Approach [22.75298609290053]
  This work proposes a procedure for designing algorithms for adaptive data collection tasks like active learning and pure-exploration multi-armed bandits. Our adaptive algorithm is learned via adversarial training over equivalence classes of problems derived from information theoretic lower bounds. We perform synthetic experiments to justify the stability and effectiveness of the training procedure, and then evaluate the method on tasks derived from real data.
  arXiv  Detail & Related papers  (2020-10-29T06:48:22Z)
• Few-shot Visual Reasoning with Meta-analogical Contrastive Learning [141.2562447971]
  We propose to solve a few-shot (or low-shot) visual reasoning problem, by resorting to analogical reasoning. We extract structural relationships between elements in both domains, and enforce them to be as similar as possible with analogical learning. We validate our method on RAVEN dataset, on which it outperforms state-of-the-art method, with larger gains when the training data is scarce.
  arXiv  Detail & Related papers  (2020-07-23T14:00:34Z)
• On the Nature of Programming Exercises [0.0]
  It is essential to understand that the nature of a programming exercise is an important factor for the success and consistent learning. This paper explores different approaches on the creation of a programming exercise.
  arXiv  Detail & Related papers  (2020-06-25T15:22:26Z)
• Annotation-free Learning of Deep Representations for Word Spotting using Synthetic Data and Self Labeling [4.111899441919165]
  We present an annotation-free method that still employs machine learning techniques. We achieve state-of-the-art query-by-example performances. Our method allows to perform query-by-string, which is usually not the case for other annotation-free methods.
  arXiv  Detail & Related papers  (2020-03-04T10:46:25Z)

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.