Intentionally-underestimated Value Function at Terminal State for Temporal-difference Learning with Mis-designed Reward
Not on the map. Why?
Abstract (arXiv)
Robot control using reinforcement learning has become popular, but its learning process generally terminates halfway through an episode for safety and time-saving reasons. This study addresses the problem of the most popular exception handling that temporal-difference (TD) learning performs at such termination. That is, by forcibly assuming zero value after termination, unintentionally implicit underestimation or overestimation occurs, depending on the reward design in the normal states. When the episode is terminated due to task failure, the failure may be highly valued with the unintentional overestimation, and the wrong policy may be acquired. Although this problem can be avoided by paying attention to the reward design, it is essential in practical use of TD learning to review the exception handling at termination. This paper therefore proposes a method to intentionally underestimate the value after termination to avoid learning failures due to the unintentional overestimation. In addition, the degree of underestimation is adjusted according to the degree of stationarity at termination, thereby preventing excessive exploration due to the intentional underestimation. Simulations and real robot experiments showed that the proposed method can stably obtain the optimal policies for various tasks and reward designs. https://youtu.be/AxXr8uFOe7M
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 13 of its 31 references that are in the map. First posted on arXiv 24 Aug 2023.
Builds on
13 of 31 references.
References · 13
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
- 2020dm_control: Software and Tasks for Continuous Controlcited by 375
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 219
- 2021How to Train Your Robot with Deep Reinforcement Learning; Lessons We've Learnedcited by 213
- 2017Time Limits in Reinforcement Learningcited by 79
- 2020Munchausen Reinforcement Learningcited by 69
- 2022Learning Agile Skills via Adversarial Imitation of Rough Partial Demonstrationscited by 45
- 2021Ensemble Bootstrapping for Q-Learningcited by 31
- 2022Reward Bonuses with Gain Scheduling Inspired by Iterative Deepening Searchcited by 5
- 2023Soft Actor-Critic Algorithm with Truly-satisfied Inequality Constraintcited by 3
1 more
- 2017Mirror Descent Search and its Accelerationcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 1.
5 papers.
- 2024Revisiting Experience Replayable Conditionscited by 3
- 2025Improvements of Dark Experience Replay and Reservoir Sampling towards Better Balance between Consolidation and Plasticitycited by 2
- 2025Grower-in-the-Loop Interactive Reinforcement Learning for Greenhouse Climate Controlcited by 2
- 2026Pseudo-Quantized Actor-Critic Algorithm for Robustness to Noisy Temporal Difference Errorcited by 1
- 2025Guided by Guardrails: Control Barrier Functions as Safety Instructors for Robotic Learningcited by 0
- 2026Pseudo-Quantized Actor-Critic Algorithm for Robustness to Noisy Temporal Difference Error2 Apr 2026
- 2025Grower-in-the-Loop Interactive Reinforcement Learning for Greenhouse Climate Control29 May 2025
- 2025Guided by Guardrails: Control Barrier Functions as Safety Instructors for Robotic Learning24 May 2025
- 2025Improvements of Dark Experience Replay and Reservoir Sampling towards Better Balance between Consolidation and Plasticity29 Apr 2025
- 2024Revisiting Experience Replayable Conditions15 Feb 2024