.png){kind=icon}
返回
Residual Sarsa algorithm with function approximation
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-017-1303-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this work, we proposed an efficient algorithm named the residual Sarsa algorithm with function approximation (FARS) to improve the performance of the traditional Sarsa algorithm, and we use the gradient-descent method to update the function parameter vector. In the learning process, the Bellman residual method is adopted to guarantee the convergence of the algorithm, and a new rule for updating vectors of action-value functions is adopted to solve unstable and slow convergence problems. To accelerate the convergence rate of the algorithm, we introduce a new factor, named the forgotten factor, which can help improve the robustness of the algorithm's performance. Based on two classical reinforcement learning benchmark problems, the experimental results show that the FARS algorithm has better performance than other related reinforcement learning algorithms.
Keyword:
Reinforcement learning
Sarsa algorithm
Function approximation
Gradient descent
Bellman residual
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.1
论文数:
5.0K
被引数:
7.5K
机构
引用论文
Dynamic fuzzy logic and reinforcement learning for adaptive energy efficient routing in mobile ad-hoc networks动态模糊逻辑和强化学习在移动ad-hoc网络自适应节能路由中的应用
PREAI
分享收藏Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path基于Bellman残差最小化的拟合策略迭代和单样本路径学习接近最优的策略.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容