mlsanityData to 7 Oct 2026

Off-Policy Reinforcement Learning with Loss Function Weighted by Temporal Difference Error

arXiv 2212.13175 ↗First posted 26 Dec 2022cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Training agents via off-policy deep reinforcement learning (RL) requires a large memory, named replay memory, that stores past experiences used for learning. These experiences are sampled, uniformly or non-uniformly, to create the batches used for training. When calculating the loss function, off-policy algorithms assume that all samples are of the same importance. In this paper, we hypothesize that training can be enhanced by assigning different importance for each experience based on their temporal-difference (TD) error directly in the training objective. We propose a novel method that introduces a weighting factor for each experience when calculating the loss function at the learning stage. In addition to improving convergence speed when used with uniform sampling, the method can be combined with prioritization methods for non-uniform sampling. Combining the proposed method with prioritization methods improves sampling efficiency while increasing the performance of TD-based off-policy RL algorithms. The effectiveness of the proposed method is demonstrated by experiments in six environments of the OpenAI Gym suite. The experimental results demonstrate that the proposed method achieves a 33%~76% reduction of convergence speed in three environments and an 11% increase in returns and a 3%~10% increase in success rate for other three environments.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 50 references that are in the map. First posted on arXiv 26 Dec 2022.

Builds on

22 of 50 references.

References · 22

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2015Continuous control with deep reinforcement learningcited by 3,279
  3. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  4. 2016OpenAI Gymcited by 1,684
  5. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
  6. 2017Hindsight Experience Replaycited by 1,096
  7. 2015Prioritized Experience Replaycited by 1,070
  8. 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 400
  9. 2017Deep Reinforcement Learning: An Overviewcited by 327
  10. 2017A Deeper Look at Experience Replaycited by 104
  11. 2019Measuring the Reliability of Reinforcement Learning Algorithmscited by 49
  12. 2022AutoBalance: Optimized Loss Functions for Imbalanced Datacited by 49
10 more
  1. 2018Remember and Forget for Experience Replaycited by 42
  2. 2020Experience Replay with Likelihood-free Importance Weightscited by 42
  3. 2019Deep Reinforcement Learning for Imbalanced Classificationcited by 24
  4. 2022Learning to Re-weight Examples with Optimal Transport for Imbalanced Classificationcited by 23
  5. 2022Zipfian environments for Reinforcement Learningcited by 13
  6. 2022Path Planning of Cleaning Robot with Reinforcement Learningcited by 7
  7. 2021Two-stage training algorithm for AI robot soccercited by 4
  8. 2021Reinforcement Learning for Navigation of Mobile Robot with LiDARcited by 4
  9. 2022Reinforcement Learning for Predicting Traffic Accidentscited by 2
  10. 2022Kick-motion Training with DQN in AI Soccer Environmentcited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.