Graph Enhanced Hierarchical Reinforcement Learning for Goal-oriented Learning Path Recommendation

强化学习 计算机科学 目标导向 马尔可夫决策过程 图形 路径(计算) 人工智能 机器学习 任务(项目管理) 目标设定 马尔可夫过程 理论计算机科学 统计 经济 管理 程序设计语言 社会心理学 数学 心理学
作者
Qingyao Li,Wei Xia,Liang Yin,Jian Shen,Renting Rui,Weinan Zhang,Xianyu Chen,Ruiming Tang,Yong Yu
标识
DOI:10.1145/3583780.3614897
摘要

Goal-oriented Learning path recommendation aims to recommend learning items (concepts or exercises) step-by-step to a learner to promote the mastery level of her specific learning goals. By formulating this task as a Markov decision process, reinforcement learning (RL) methods have demonstrated great power. Although extensive research efforts have been made, previous methods still fail to recommend effective goal-oriented paths due to the under-utilizing of goals. Specifically, it is mainly reflected in two aspects: (1)The lack of goal planning. When learners have multiple goals with different difficulties, the previous methods can't fully utilize the difficulties and dependencies between goal learning items to plan the sequence of achieving these goals, making the path chaotic and inefficient; (2)The lack of efficiency in goal achieving. When pursuing a single goal, the path may contain learning items unrelated to the goal, which makes realizing a certain goal inefficient. To address these challenges, we present a novel Graph Enhanced Hierarchical Reinforcement Learning (GEHRL) framework for goal-oriented learning path recommendation. The framework divides learning path recommendation into two parts: sub-goal selection(planning) and sub-goal achieving(learning item recommendation). Specifically, we employ a high-level agent as a sub-goal selector to select sub-goals for the low-level agent to achieve. The low-level agent in the framework is to recommend learning items to the learner. To make the path only contain goal-related learning items to improve the efficiency of achieving the goal, we develop a graph-based candidate selector to constrain the action space of the low-level agent based on the sub-goal and knowledge graph. We also develop test-based internal reward for low-level training so that the sparsity problem of external reward can be alleviated. Extensive experiments on three different simulators demonstrate our framework achieves state-of-the-art performance.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
曾经的问夏完成签到 ,获得积分10
1秒前
nove999完成签到 ,获得积分0
4秒前
houmi发布了新的文献求助10
5秒前
5秒前
AllRightReserved完成签到 ,获得积分10
5秒前
科目三应助李言新采纳,获得10
7秒前
7秒前
聪明的梦槐完成签到 ,获得积分20
10秒前
凝安发布了新的文献求助10
12秒前
吕小布完成签到,获得积分10
13秒前
彭于晏应助孤风采纳,获得10
14秒前
星辰完成签到,获得积分10
15秒前
16秒前
liuzhuohao应助辣辣采纳,获得10
17秒前
20秒前
广泛的完成签到,获得积分10
21秒前
余如龙完成签到,获得积分10
22秒前
JiangHb完成签到,获得积分10
25秒前
xiaxia42完成签到 ,获得积分0
27秒前
adeno完成签到,获得积分10
27秒前
28秒前
义气的采文完成签到,获得积分10
29秒前
科研通AI6.4应助不死鸟采纳,获得10
29秒前
广泛的发布了新的文献求助10
29秒前
Food琉尤完成签到 ,获得积分10
31秒前
火星上的青亦完成签到,获得积分10
32秒前
tianugui完成签到,获得积分10
33秒前
桐桐应助波波波波波6764采纳,获得10
33秒前
Kidgod完成签到,获得积分10
33秒前
朴素的晓灵完成签到,获得积分20
33秒前
adeno发布了新的文献求助10
34秒前
真圆完成签到 ,获得积分10
34秒前
又丁完成签到,获得积分20
36秒前
NANA完成签到 ,获得积分10
38秒前
39秒前
大月儿完成签到 ,获得积分10
39秒前
41秒前
heartyi完成签到 ,获得积分10
41秒前
Nole应助向往的鱼采纳,获得10
42秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Nondestructive Testing Handbook: Vol. 4, Thermal and Infrared Testing (IR), 4th ed 800
Understanding Acculturation: The Process of Cultural Adjustment as Applied to International Migration 700
作者名:Kristopher P. Plain,悉尼大学的,目前只能查到其四篇论文,想找到其博士论文 590
Évora na Idade Média 555
Soil mites of the family Rhagidiidae (Actinedida: Eupodoidea). Morphology, Systematics, Ecology 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7370934
求助须知:如何正确求助?哪些是违规求助? 8978519
关于积分的说明 19087621
捐赠科研通 7012975
什么是DOI,文献DOI怎么找? 3224993
关于科研通互助平台的介绍 2388627
邀请新用户注册赠送积分活动 2205666