返回
Online attentive kernel-based temporal difference learning
DOI:10.1016/j.knosys.2023.110902.png)
摘要
En 中文
Kernel-based reinforcement learning has received increasing attention because it requires less prior knowledge linear approximation and neural networks. Online kernel-based updating, however, is hindered by the challenge of catastrophic forgetting or interference. Sparse representation is a key method to address this issue, but existing methods fail to satisfy four criteria: learnability, nonprior, nontruncation, and explicitness. In this paper, we present an attentive kernel-based value function approximation as a learnable, nonprior, nontruncated, and explicit sparse representation. We propose the online attentive kernel-based temporal difference (OAKTD) algorithm, which employs twotimescale optimization, and provide a convergence analysis for our proposed algorithm. Experimental results show that OAKTD outperforms online kernel-based TD learning algorithms, and the TD learning algorithm with Tile Coding on classical tasks, i.e., Mountain Car, Acrobot, CartPole and Puddle World. (c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Online kernel-based reinforcement learning
Catastrophic forgetting or interference
Sparse representation
Attentive function
Two-timescale optimization
Stability analysis
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
ADRL: An attention-based deep reinforcement learning framework for knowledge graph reasoningADRL: 一种基于注意力的深度强化学习知识图推理框架
ICT for informal workers in Sub-Saharan Africa: Systematic review and analysis撒哈拉以南非洲非正规工人的信通技术: 系统回顾和分析
Echocardiographic assessment of abnormal left ventricular relaxation in man.超声心动图评估男性异常左心室舒张。
Heart
IF0

