arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.03789cs.LGcs.AIstat.ML
收藏

基于反馈图的强化学习

Reinforcement Learning with Feedback Graphs

Cornell University(康奈尔大学);Tel Aviv University(特拉维夫大学);Google Research(谷歌研究院);Courant Institute of Mathematical Sciences(柯朗数学科学研究所)

Christoph Dann, Yishay Mansour, Mehryar Mohri, Ayush Sekhari, Karthik Sridharan

摘要:

我们研究了马尔可夫决策过程中的情景强化学习,当代理每一步都以几个过渡观察的形式接收额外的反馈时。这种额外的观察在一系列任务中通过扩展的传感器或关于环境的先验知识(例如,当某些行为产生类似的结果时)。我们使用状态-动作对的反馈图来正式化这种设置,并表明基于模型的算法可以利用额外的反馈来进行更有效的学习。我们给出了一个遗憾的界限,忽略对数因子和低阶项,仅取决于反馈图的最大非循环子图的大小,与多项式依赖的状态和动作的数量在没有反馈图。最后,我们强调挑战时,利用一个小的支配集的反馈图相比,强盗设置,并提出了一个新的算法,可以使用这样的支配集的知识,更样本有效的学习一个接近最优的政策。

英文摘要:

We study episodic reinforcement learning in Markov decision processes when the agent receives additional feedback per step in the form of several transition observations. Such additional observations are available in a range of tasks through extended sensors or prior knowledge about the environment (e.g., when certain actions yield similar outcome). We formalize this setting using a feedback graph over state-action pairs and show that model-based algorithms can leverage the additional feedback for more sample-efficient learning. We give a regret bound that, ignoring logarithmic factors and lower-order terms, depends only on the size of the maximum acyclic subgraph of the feedback graph, in contrast with a polynomial dependency on the number of states and actions in the absence of a feedback graph. Finally, we highlight challenges when leveraging a small dominating set of the feedback graph as compared to the bandit setting and propose a new algorithm that can use knowledge of such a dominating set for more sample-efficient learning of a near-optimal policy.

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

↑