Speaker
Description
Traditional teaching methods struggle to accommodate differences in prior knowledge, personality, and motivation. While suitable for mass instruction, they cannot match the benefits of individualized tutoring—a gap documented by Bloom's 2-sigma problem. This work leverages artificial intelligence to bring some of these benefits to students at scale. We present AdaptEd, an adaptive learning system for programming in which lessons are structured as directed acyclic graphs. At each branching point, a Liquid Time-Constant (LTC) neural network selects the difficulty level for the next segment based on a 19-dimensional context vector combining psychological traits, session state, and recent performance. The classifier contains only 3,427 parameters and trains in approximately 15 seconds. On our test set, the class-balanced LTC model achieves 75.3% accuracy with a macro-F1 of 0.692. Though a rule-based baseline attains higher overall accuracy, the LTC network generalizes considerably better on the rare but pedagogically important HARD class (F1 of 0.636 versus 0.444). A complementary simulation over 25,000 episodes comparing five decision policies reveals that profile-aware policies produce the highest gains in competency. In contrast, a reward-maximizing Deep Q-Network avoids difficult content and produces the least learning—highlighting the risks of naive reward maximization in adaptive education.