With the increasing popularity of online learning, intelligent tutoring systems are regaining increased attention. In this paper, we introduce adaptive algorithms for personalized assignment of learning tasks to student so that to improve his performance in online learning environments. As main contribution of this paper, we propose a a novel Skill-Based Task Selector (SBTS) algorithm which is able to approximate a student's skill level based on his performance and consequently suggest adequate assignments. The SBTS is inspired by the class of multi-armed bandit algorithms. However, in contrast to standard multi-armed bandit approaches, the SBTS aims at acquiring two criteria related to student learning, namely: which topics should the student work on, and what level of difficulty should the task be. The SBTS centers on innovative reward and punishment schemes in a task and skill matrix based on the student behaviour.
To verify the algorithm, the complex student behaviour is modelled using a neighbour node selection approach based on empirical estimations of a students learning curve. The algorithm is evaluated with a practical scenario from a basic java programming course. The SBTS is able to quickly and accurately adapt to the composite student competency --- even with a multitude of student models.
Online Task Assignment Problems with Reusable Resources
Tokyo Institute of Technology(东京工业大学);NEC Corporation(日本电气股份有限公司);RIKEN AIP(理化学研究所先进智能项目中心);Chuo University(中央大学);Keio University(庆应义塾大学);National Institute of Informatics(国立信息学研究所)
vivo AI Lab(vivo人工智能实验室);Zhejiang Lab(浙江实验室);CUHK MMLab(香港大学多模态实验室);Hubei University(湖北省大学);Hangzhou Institute for Advanced Study, University of Chinese Academy of Sciences(中国科学院大学杭州高等研究院)
EvoSteer: Online Self-Evolving Graph Orchestration via Reference-Anchored Credit Assignment
The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));Dalian University of Technology(大连理工大学);Fudan University(复旦大学);University of Oxford(牛津大学);North China Electric Power University(华北电力大学);The University of Texas Health Science Center at Houston(德克萨斯大学休斯顿健康科学中心)
Minimal Ingredients for Reward Assignment from Expert Demonstrations
New York University(纽约大学);New York University Abu Dhabi(纽约大学阿布扎赫尔分校);Shanghai Frontiers Science Center of Artificial Intelligence and Deep Learning, NYU Shanghai(上海前沿科学中心(人工智能与深度学习))
MOCA: Self-supervised Representation Learning by Predicting Masked Online Codebook Assignments
Czech Institute of Informatics, Robotics and Cybernetics at the Czech Technical University in Prague(布拉格捷克技术大学捷克信息学、机器人与控制论研究所);Czech Technical University in Prague(布拉格捷克技术大学);University of Crete(克里特大学);IACM-Forth(希腊研究与技术基金会伊阿基莫斯研究所);Archimedes/Athena RC(阿基米德/雅典娜研究中心)