Off-Policy Reinforcement Learning with Delayed RewardsDownload PDF


Sep 29, 2021 (edited Oct 04, 2021)ICLR 2022 Conference Blind SubmissionReaders: Everyone
  • Keywords: Delayed Rewards, Off-Policy Reinforcement Learning
  • Abstract: We study deep reinforcement learning (RL) algorithms with delayed rewards. In many real-world tasks, instant rewards are often not readily accessible or even defined immediately after the agent performs actions. In this work, we first formally define the environment with delayed rewards and discuss the challenges raised due to the non-Markovian nature of such environments. Then, we introduce a general off-policy RL framework with a new $Q$-function formulation that can handle the delayed rewards with theoretical convergence guarantees. For practical tasks with high dimensional state spaces, we further introduce the HC-decomposition rule of the $Q$-function in our framework which naturally leads to an approximation scheme that helps boost the training efficiency and stability. We finally conduct extensive experiments to demonstrate the superior performance of our algorithms over the existing work and their variants.
  • One-sentence Summary: We put forward a SOTA off-policy RL algorithm that can handle non-Markovian rewards with theoretical support.
  • Supplementary Material: zip
0 Replies