Learning Long-Term Reward Redistribution via Randomized Return Decomposition

Abstract

Many practical applications of reinforcement learning require agents to learn from sparse and delayed rewards. It challenges the ability of agents to attribute their actions to future outcomes. In this paper, we consider the problem formulation of episodic reinforcement learning with trajectory feedback. It refers to an extreme delay of reward signals, in which the agent can only obtain one reward signal at the end of each trajectory. A popular paradigm for this problem setting is learning with a designed auxiliary dense reward function, namely proxy reward, instead of sparse environmental signals. Based on this framework, this paper proposes a novel reward redistribution algorithm, randomized return decomposition (RRD), to learn a proxy reward function for episodic reinforcement learning. We establish a surrogate problem by Monte-Carlo sampling that scales up least-squares-based reward redistribution to long-horizon problems. We analyze our surrogate loss function by connection with existing methods in the literature, which illustrates the algorithmic properties of our approach. In experiments, we extensively evaluate our proposed method on a variety of benchmark tasks with episodic rewards and demonstrate substantial improvement over baseline algorithms.

Tenth International Conference on Learning Representations (ICLR 2022 Spotlight)

References in corpus (9)

• QTRAN: Learning to Factorize with Transformation for Cooperative Multi-Agent Reinforcement Learning
• Dopamine: A Research Framework for Deep Reinforcement Learning
• QPLEX: Duplex Dueling Multi-Agent Q-Learning
• Hyperbolic Discounting and Learning over Multiple Horizons
• Hindsight Credit Assignment
• Sequence Modeling of Temporal Credit Assignment for Episodic Reinforcement Learning
• Off-Policy Reinforcement Learning with Delayed Rewards
• Synthetic Returns for Long-Term Credit Assignment
• On the Theory of Reinforcement Learning with Once-per-Episode Feedback