真に決定論的な方策最適化
Truly Deterministic Policy Optimization
探索ノイズを注入せず決定論的方策空間で探索する方策勾配法TDPOを提案し、Wasserstein型二次モデルによる単調改善保証と厳密なアドバンテージ推定を示した。周波数領域の非局所報酬や8000ステップの長地平線タスクで既存手法を大きく上回る。
著者: Ehsan Saleh, Saba Ghaffari, Timothy Bretl, Matthew West
分類: cs.AI, cs.LG, cs.RO, cs.SY, eess.SY
原文アブストラクト
In this paper, we present a policy gradient method that avoids exploratory noise injection and performs policy search over the deterministic landscape. By avoiding noise injection all sources of estimation variance can be eliminated in systems with deterministic dynamics (up to the initial state distribution). Since deterministic policy regularization is impossible using traditional non-metric measures such as the KL divergence, we derive a Wasserstein-based quadratic model for our purposes. We state conditions on the system model under which it is possible to establish a monotonic policy improvement guarantee, propose a surrogate function for policy gradient estimation, and show that it is possible to compute exact advantage estimates if both the state transition model and the policy are deterministic. Finally, we describe two novel robotic control environments -- one with non-local rewards in the frequency domain and the other with a long horizon (8000 time-steps) -- for which our policy gradient method (TDPO) significantly outperforms existing methods (PPO, TRPO, DDPG, and TD3). Our implementation with all the experimental settings is available at https://github.com/ehsansaleh/code_tdpo
