Can machine learning solve the challenge of adaptive learning and the individualization of learning paths? A field experiment in an online learning platform

• URL: http://arxiv.org/abs/2407.03118v3
• Date: Mon, 15 Jul 2024 19:53:55 GMT
• Title: Can machine learning solve the challenge of adaptive learning and the individualization of learning paths? A field experiment in an online learning platform
• Authors: Tim Klausmann, Marius Köppel, Daniel Schunk, Isabell Zipperle,
• Abstract summary: The individualization of learning contents based on digital technologies promises large individual and social benefits. We conduct a randomized controlled trial on a large digital self-learning platform. We develop an algorithm based on two convolutional neural networks that assigns tasks to $4,365$ learners according to their learning paths.
• Score: 0.8437187555622164
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The individualization of learning contents based on digital technologies promises large individual and social benefits. However, it remains an open question how this individualization can be implemented. To tackle this question we conduct a randomized controlled trial on a large digital self-learning platform. We develop an algorithm based on two convolutional neural networks that assigns tasks to $4,365$ learners according to their learning paths. Learners are randomized into three groups: two treatment groups -- a group-based adaptive treatment group and an individual adaptive treatment group -- and one control group. We analyze the difference between the three groups with respect to effort learners provide and their performance on the platform. Our null results shed light on the multiple challenges associated with the individualization of learning paths.

Related papers

• Educational Customization by Homogenous Grouping of e-Learners based on their Learning Styles [0.4915744683251149]
  We propose using the Felder-Silverman model, which is based on learning styles, to group similar learners. By identifying the learning styles of the learners, co-like learning groups are formed, and each group receives adaptive content based on their preferences, needs, talents, and abilities. In terms of "educational success," the weighted average score of the experimental group is 17.65 out of 20, while the control group achieves a score of 12.6 out of 20.
  arXiv  Detail & Related papers  (2024-08-09T14:06:42Z)
• Towards Scalable Adaptive Learning with Graph Neural Networks and Reinforcement Learning [0.0]
  We introduce a flexible and scalable approach towards the problem of learning path personalization. Our model is a sequential recommender system based on a graph neural network. Our results demonstrate that it can learn to make good recommendations in the small-data regime.
  arXiv  Detail & Related papers  (2023-05-10T18:16:04Z)
• Learning by Grouping: A Multilevel Optimization Framework for Improving Fairness in Classification without Losing Accuracy [19.84719054826755]
  In some cases, AI systems can be unfair by exhibiting bias or discrimination against certain social groups. We propose a novel machine learning framework where the ML model learns to group a diverse set of problems into distinct subgroups to solve each subgroup. Our proposed framework involves three stages of learning, which are formulated as a three-level optimization problem.
  arXiv  Detail & Related papers  (2023-04-02T08:45:08Z)
• The Group Loss++: A deeper look into group loss for deep metric learning [65.19665861268574]
  Group Loss is a loss function based on a differentiable label-propagation method that enforces embedding similarity across all samples of a group. We show state-of-the-art results on clustering and image retrieval on four datasets, and present competitive results on two person re-identification datasets.
  arXiv  Detail & Related papers  (2022-04-04T14:09:58Z)
• What Matters in Learning from Offline Human Demonstrations for Robot Manipulation [64.43440450794495]
  We conduct an extensive study of six offline learning algorithms for robot manipulation. Our study analyzes the most critical challenges when learning from offline human data. We highlight opportunities for learning from human datasets.
  arXiv  Detail & Related papers  (2021-08-06T20:48:30Z)
• Constructing a personalized learning path using genetic algorithms approach [0.0]
  This paper presents the possibility of constructing personalized learning paths using genetic algorithm-based model. Experiments show that the genetic algorithm is suitable to generate optimal learning paths based on learning object difficulty level, duration, rating, and relation degree.
  arXiv  Detail & Related papers  (2021-04-22T18:43:47Z)
• Towards Improved and Interpretable Deep Metric Learning via Attentive Grouping [103.71992720794421]
  Grouping has been commonly used in deep metric learning for computing diverse features. We propose an improved and interpretable grouping method to be integrated flexibly with any metric learning framework.
  arXiv  Detail & Related papers  (2020-11-17T19:08:24Z)
• Hierarchical Affordance Discovery using Intrinsic Motivation [69.9674326582747]
  We propose an algorithm using intrinsic motivation to guide the learning of affordances for a mobile robot. This algorithm is capable to autonomously discover, learn and adapt interrelated affordances without pre-programmed actions. Once learned, these affordances may be used by the algorithm to plan sequences of actions in order to perform tasks of various difficulties.
  arXiv  Detail & Related papers  (2020-09-23T07:18:21Z)
• Learning Compositional Neural Programs for Continuous Control [62.80551956557359]
  We propose a novel solution to challenging sparse-reward, continuous control problems. Our solution, dubbed AlphaNPI-X, involves three separate stages of learning. We empirically show that AlphaNPI-X can effectively learn to tackle challenging sparse manipulation tasks.
  arXiv  Detail & Related papers  (2020-07-27T08:27:14Z)
• A Machine Learning Approach to Assess Student Group Collaboration Using Individual Level Behavioral Cues [8.840643644938156]
  We propose using simple deep-learning-based machine learning models to automatically determine the overall collaboration quality of a group. We come across the following challenges when building these models: 1) Limited training data, 2) Severe class label imbalance.
  arXiv  Detail & Related papers  (2020-07-13T20:15:29Z)
• Three Approaches for Personalization with Applications to Federated Learning [68.19709953755238]
  We present a systematic learning-theoretic study of personalization. We provide learning-theoretic guarantees and efficient algorithms for which we also demonstrate the performance. All of our algorithms are model-agnostic and work for any hypothesis class.
  arXiv  Detail & Related papers  (2020-02-25T01:36:43Z)

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.