Decomposed Inductive Procedure Learning: Learning Academic Tasks with Human-Like Data Efficiency

Daniel Weitekamp, Christopher MacLellan, Erik Harpstead, Kenneth Koedinger
5/15/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Human learning relies on specialization -- distinct cognitive mechanisms working together to enable rapid learning. In contrast, most modern neural networks rely on a single mechanism: gradient descent over an objective function. This raises the question: might human learners' relatively rapid learning from just tens of examples instead of tens of thousands in data-driven deep learning arise from our ability to use multiple specialized mechanisms of learning in combination? We investigate this question through an ablation analysis of inductive human learning simulations in online tutoring environments. Comparing reinforcement learning to a more data-efficient 3-mechanism symbolic rule induction approach, we find that decomposing learning into multiple distinct mechanisms significantly improves data efficiency, bringing it in line with human learning. Furthermore, we show that this decomposition has a greater impact on efficiency than the distinction between symbolic and subsymbolic learning alone. Efforts to align data-driven machine learning with human learning often overlook the stark difference in learning efficiency. Our findings suggest that integrating multiple specialized learning mechanisms may be key to bridging this gap.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{weitekamp2025decomposed,
  title  = {Decomposed Inductive Procedure Learning: Learning Academic Tasks with Human-Like Data Efficiency},
  author = {Daniel Weitekamp and Christopher MacLellan and Erik Harpstead and Kenneth Koedinger},
  year   = {2025},
  eprint = {2505.10422},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.10422v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.10422.svg)](https://codeofpaper.com/paper/2505.10422)

Discussion