Safe and Robust Experience Sharing for Deterministic Policy Gradient Algorithms

Baturay Saglam, Dogan C. Cicek, Furkan B. Mutlu, Suleyman S. Kozat
7/27/2022
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Learning in high dimensional continuous tasks is challenging, mainly when the experience replay memory is very limited. We introduce a simple yet effective experience sharing mechanism for deterministic policies in continuous action domains for the future off-policy deep reinforcement learning applications in which the allocated memory for the experience replay buffer is limited. To overcome the extrapolation error induced by learning from other agents' experiences, we facilitate our algorithm with a novel off-policy correction technique without any action probability estimates. We test the effectiveness of our method in challenging OpenAI Gym continuous control tasks and conclude that it can achieve a safe experience sharing across multiple agents and exhibits a robust performance when the replay memory is strictly limited.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{saglam2022safe,
  title  = {Safe and Robust Experience Sharing for Deterministic Policy Gradient Algorithms},
  author = {Baturay Saglam and Dogan C. Cicek and Furkan B. Mutlu and Suleyman S. Kozat},
  year   = {2022},
  eprint = {2207.13453},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.13453v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.13453.svg)](https://codeofpaper.com/paper/2207.13453)

Discussion