In plain words: Standard reinforcement learning assumes the world freezes while the agent picks an action, which breaks down in real time. A new framework lets the state keep changing during action choice, and the resulting algorithm beats the top continuous-control method in real-time and normal settings.
Abstract
Markov Decision Processes (MDPs), the mathematical framework underlying most algorithms in Reinforcement Learning (RL), are often used in a way that wrongfully assumes that the state of an agent's environment does not change during action selection. As RL systems based on MDPs begin to find application in real-world safety critical situations, this mismatch between the assumptions underlying classical MDPs and the reality of real-time computation may lead to undesirable outcomes. In this paper, we introduce a new framework, in which states and actions evolve simultaneously and show how it is related to the classical MDP formulation. We analyze existing algorithms under the new real-time formulation and show why they are suboptimal when used in real-time. We then use those insights to create a new algorithm Real-Time Actor-Critic (RTAC) that outperforms the existing state-of-the-art continuous control algorithm Soft Actor-Critic both in real-time and non-real-time settings. Code and videos can be found at https://github.com/rmst/rtrl.
Simon Ramstedt, Christopher Pal
arXiv:1911.04448 · cs.LG, stat.ML · submitted Nov 11, 2019 · updated Dec 12, 2019
abstract · pdf · html · Neural Information Processing Systems (2019)