arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.07555cs.LGcs.AIcs.SYeess.SYmath.OC
收藏

再论随机时滞强化学习的状态增强方法

Revisiting State Augmentation methods for Reinforcement Learning with Stochastic Delays

TCS Research(塔塔咨询服务研究部);IIT Bombay(印度理工学院孟买分校)

Somjit Nath, Mayank Baranwal, Harshad Khadilkar

摘要:

几个现实世界的场景,如远程控制和传感,是由行动和观察延迟。延迟的存在降低了强化学习(RL)算法的性能,通常会导致算法无法学习任何实质性内容。本文正式描述了马尔可夫决策过程(MDP)的概念与随机延迟,并表明延迟MDP可以转化为等价的标准MDP(无延迟)显着简化的成本结构。我们采用这种等价性来推导出一个无模型的延迟解析RL框架,并表明即使是建立在这个框架上的简单RL算法,在行动和观察具有随机延迟的环境中也能获得接近最优的奖励。延迟分辨深度Q网络(DRDQN)算法在包括多步和随机延迟的各种环境上进行基准测试,并且相对于当前建立的算法,在实现接近最优的奖励和最小化其计算开销方面都产生更好的性能。

英文摘要:

Several real-world scenarios, such as remote control and sensing, are comprised of action and observation delays. The presence of delays degrades the performance of reinforcement learning (RL) algorithms, often to such an extent that algorithms fail to learn anything substantial. This paper formally describes the notion of Markov Decision Processes (MDPs) with stochastic delays and shows that delayed MDPs can be transformed into equivalent standard MDPs (without delays) with significantly simplified cost structure. We employ this equivalence to derive a model-free Delay-Resolved RL framework and show that even a simple RL algorithm built upon this framework achieves near-optimal rewards in environments with stochastic delays in actions and observations. The delay-resolved deep Q-network (DRDQN) algorithm is bench-marked on a variety of environments comprising of multi-step and stochastic delays and results in better performance, both in terms of achieving near-optimal rewards and minimizing the computational overhead thereof, with respect to the currently established algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑