The study analyzes 22 OULAD asynchronous online courses (over 22,000 learners) using Zigzag Persistent Homology to track the number of disconnected behavioral clusters, denoted $eta_0$. It finds that changes in $eta_0$ strongly co‑vary with active learner counts, indicating that $eta_0$ is a participation‑sensitive indicator rather than a cause of dropout. Assessment deadlines trigger fragmentation in 82.6% of cases and the full Fragment First, Converge Later cycle in 60.2%, with long‑term fragmentation dominating 90.9% of courses.
By Hitoshi Inoue, Koichi Yasutake
arXiv:2606. 15349v1 Announce Type: cross Abstract: Standardized examinations are typically treated as uniform syllabus coverage problems.
By Joy Bose, Om Thomas
arXiv:2605. 31191v2 Announce Type: replace Abstract: We investigate how teacher-student capacity relationships modulate knowledge distillation (KD) effectiveness in ResNet-based image classification on CIFAR-10.
By Umut Onur Yasar
The paper introduces a validation protocol for knowledge‑tracing models that jointly assesses predictive performance, explanation stability, and faithfulness. Using engineered behavioral features from ASSISTments data, the authors compare an XGBoost model explained with TreeSHAP against four deep‑learning baselines, finding comparable predictive accuracy when information is matched and demonstrating that TreeSHAP rankings are stable and impactful. The study highlights how data preprocessing (e.g., rebuilding the 2009 dataset) can affect both model performance and explanation outcomes.
By Praveena Padi, Arun Morampudi, Ujval Sai Gopal Irrinki, Pradeep Kumar Dolabehera Kakitapelli
The study investigates how a single mastery threshold can produce divergent outcomes across different knowledge tracing (KT) models. By evaluating six KT models on four datasets with thresholds ranging from 0.50 to 0.99, the authors find that Bayesian Knowledge Tracing (BKT) is relatively insensitive to threshold changes, whereas neural models become increasingly selective as thresholds rise. The optimal threshold varies widely across models and instructional settings, and stricter thresholds can disproportionately limit advancement for weaker students.
By Xianghui Meng, Yujing Zhang, Jionghao Lin
arXiv:2607. 26063v1 Announce Type: cross Abstract: Personalised learning systems often assume that mathematical ability is combined of discrete abilities, acquired sequentially and dependent upon first acquiring foundational abilities, and students often report different strengths.
By Benjamin Mawdsley, Tom Quilter, Richard Turner, Sarah Jackson, Paul Edwards
arXiv:2609.05435v1 Announce Type: new
Abstract: Modern language agents are expected to operate over long horizons: they ask follow-up questions, reuse worked examples, handle tool feedback, and adapt...
By Zerui Cheng, Jiawei Xu, Huacan Chai, Jiayang Sun, Pramod Viswanath, Maxm Pan
The paper introduces StepLearn, a nonparametric framework for prequential test‑time learning in large language model agents. StepLearn separates immediate use of informative transitions from persistent trust, turning each transition into a hypothesis that guides the next step and only reusing it after prospective validation across episodes. Experiments on WebArena‑Lite and ALFWorld show StepLearn improves success rates by 2.2–12.7 percentage points over the strongest baseline, with benefits evident from the first task attempts.
By Tong Zhao, Reed Li, Yuyang Hu, Yutao Zhu, Haijin Liang, Haibo Shi, Yu Lu, Zhicheng Dou
arXiv:2608. 03206v1 Announce Type: cross Abstract: Large language models (LLMs) power educational applications from tutoring to essay scoring, but each is a point solution to a single task, and only recently have these point solutions been integrated into agents operating over a learning management system (LMS).
By Unggi Lee, Sookbun Lee, Yeil Jeong, Eunjoo Lee, Minchul Shin, Hoilym Kwon
arXiv:2607. 13103v1 Announce Type: cross Abstract: Knowledge tracing (KT) aims to predict students' future performance by modeling their evolving knowledge states from historical interactions.
By Duantengchuan Li, Yingqian Bi, Jinsong Chen, Rui Zhang, Mingwen Tong
arXiv:2608. 09826v1 Announce Type: cross Abstract: Reinforcement learning with verifiable rewards yields no group-relative signal when rollout groups are uniformly correct or uniformly wrong, which account for 63.
By Yubo Jiang, Fengying Xie, Zhiguo Jiang, Haopeng Zhang
arXiv:2609.14636v1 Announce Type: new
Abstract: On-policy distillation (OPD) has become a standard approach for transferring capabilities from large teachers to compact students. Its cost, however, i...
By Zhiyu Gui, Kexin Huang, Jia Guo, Junkang Wu, Zihao Wang, Zhiqiang Zhang, Jun Zhou, Jiancan Wu, Xiang Wang