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

带约束的深度逆Q学习

Deep Inverse Q-learning with Constraints

University of Freiburg(弗赖堡大学)

Gabriel Kalweit, Maria Huegle, Moritz Werling, Joschka Boedecker

摘要:

流行的最大熵逆强化学习方法需要在奖励函数的估计下计算最优策略的期望状态访问频率。这通常需要在算法的内部循环中进行中间值估计,从而大大减慢收敛速度。在这项工作中,我们引入了一类新的算法,只需要解决MDP底层的演示行为一次恢复专家的政策。这是可能的,通过一个公式,利用概率行为假设的示范结构内的Q学习。我们提出了逆向迭代算法,它能够完全恢复外部代理的封闭形式的潜在奖励。我们还提供了一个附带的类的基于采样的变量,不依赖于环境的模型。我们将展示如何扩展这类算法的连续状态空间,通过函数逼近和如何估计相应的动作价值函数,导致尽可能接近的政策的外部代理,同时可选地满足预定义的硬约束的列表。我们在Objectworld基准测试中评估了称为逆Q值迭代,逆Q学习和深度逆Q学习的算法,与(深度)最大熵算法相比,加速高达几个数量级。我们进一步将深度约束逆Q学习应用于在开源模拟器SUMO中学习自动变道的任务,在对对应于30分钟演示的数据进行训练后实现合格的驾驶。

英文摘要:

Popular Maximum Entropy Inverse Reinforcement Learning approaches require the computation of expected state visitation frequencies for the optimal policy under an estimate of the reward function. This usually requires intermediate value estimation in the inner loop of the algorithm, slowing down convergence considerably. In this work, we introduce a novel class of algorithms that only needs to solve the MDP underlying the demonstrated behavior once to recover the expert policy. This is possible through a formulation that exploits a probabilistic behavior assumption for the demonstrations within the structure of Q-learning. We propose Inverse Action-value Iteration which is able to fully recover an underlying reward of an external agent in closed-form analytically. We further provide an accompanying class of sampling-based variants which do not depend on a model of the environment. We show how to extend this class of algorithms to continuous state-spaces via function approximation and how to estimate a corresponding action-value function, leading to a policy as close as possible to the policy of the external agent, while optionally satisfying a list of predefined hard constraints. We evaluate the resulting algorithms called Inverse Action-value Iteration, Inverse Q-learning and Deep Inverse Q-learning on the Objectworld benchmark, showing a speedup of up to several orders of magnitude compared to (Deep) Max-Entropy algorithms. We further apply Deep Constrained Inverse Q-learning on the task of learning autonomous lane-changes in the open-source simulator SUMO achieving competent driving after training on data corresponding to 30 minutes of demonstrations.

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

↑