Theories

Skill discovery BKT: end-to-end stochastic learning of the problem-KC assignment matrix with Gumbel-Softmax

Theory · All theories
Evidence · no claims cited

Description

This model estimates the binary problem-to-KC assignment matrix within a neural network framework by sampling each problem's KC assignment from a categorical distribution and backpropagating through samples using the Gumbel-Softmax re-parameterization trick, with a modified multi-KC BKT RNN cell whose state holds knowledge probabilities for all KCs. Problem input features can guide membership via a learnable membership function, and an auxiliary loss rewards assignments producing blocked KC sequences. The article calls this "a mechanism to estimate this discrete assignment matrix within an NN framework, which is a feat that, to our knowledge, has not been accomplished before."

Design Implications

Context

Requirements

Constraints

Target Learners

Target Learning Objectives

Claims

Examples

-

Key Sources

Page metadata
Field Value
type theory
title Skill discovery BKT: end-to-end stochastic learning of the problem-KC assignment matrix with Gumbel-Softmax
description This model estimates the binary problem-to-KC assignment matrix within a neural network framework by sampling each problem's KC assignment from a categorical distribution and backpropagating through samples using the...
status review
generated by process:wiki-ingest on 2026-09-27
trust unverified — no one has confirmed this page's content
sources 1 — khajah-2024

Frontmatter is the page's machine-readable record — see the Schema & Guide.