Episodic Reinforcement Learning with Expanded State-reward Space
Not on the map. Why?
Abstract (arXiv)
Empowered by deep neural networks, deep reinforcement learning (DRL) has demonstrated tremendous empirical successes in various domains, including games, health care, and autonomous driving. Despite these advancements, DRL is still identified as data-inefficient as effective policies demand vast numbers of environmental samples. Recently, episodic control (EC)-based model-free DRL methods enable sample efficiency by recalling past experiences from episodic memory. However, existing EC-based methods suffer from the limitation of potential misalignment between the state and reward spaces for neglecting the utilization of (past) retrieval states with extensive information, which probably causes inaccurate value estimation and degraded policy performance. To tackle this issue, we introduce an efficient EC-based DRL framework with expanded state-reward space, where the expanded states used as the input and the expanded rewards used in the training both contain historical and current information. To be specific, we reuse the historical states retrieved by EC as part of the input states and integrate the retrieved MC-returns into the immediate reward in each interactive transition. As a result, our method is able to simultaneously achieve the full utilization of retrieval information and the better evaluation of state values by a Temporal Difference (TD) loss. Empirical results on challenging Box2d and Mujoco tasks demonstrate the superiority of our method over a recent sibling method and common baselines. Further, we also verify our method's effectiveness in alleviating Q-value overestimation by additional experiments of Q-value comparison.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 39 references that are in the map. First posted on arXiv 19 Jan 2024.
Builds on
28 of 39 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2015Trust Region Policy Optimizationcited by 2,503
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2015Prioritized Experience Replaycited by 1,070
- 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
- 2018Model-Ensemble Trust-Region Policy Optimizationcited by 214
- 2017Neural Episodic Controlcited by 148
16 more
- 2018Algorithmic Framework for Model-based Deep Reinforcement Learning with Theoretical Guaranteescited by 138
- 2017Imagination-Augmented Agents for Deep Reinforcement Learningcited by 137
- 2018Deep Variational Reinforcement Learning for POMDPscited by 122
- 2017Value Prediction Networkcited by 117
- 2022RAMBO-RL: Robust Adversarial Model-Based Offline Reinforcement Learningcited by 115
- 2016Model-Free Episodic Controlcited by 100
- 2022Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexitycited by 84
- 2021DreamerPro: Reconstruction-Free Model-Based Reinforcement Learning with Prototypical Representationscited by 73
- 2017QMDP-Net: Deep Learning for Planning under Partial Observabilitycited by 51
- 2018Episodic Memory Deep Q-Networkscited by 41
- 2023What is Essential for Unseen Goal Generalization of Offline Goal-conditioned RL?cited by 36
- 2022Intelligent problem-solving as integrated hierarchical reinforcement learningcited by 21
- 2022Hypernetworks for Zero-shot Transfer in Reinforcement Learningcited by 18
- 2021Solving Continuous Control with Episodic Memorycited by 7
- 2023Neural Episodic Control with State Abstractioncited by 7
- 2023Sequential Action-Induced Invariant Representation for Reinforcement Learningcited by 3
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.