TEA: Trajectory Encoding Augmentation for Robust and Transferable Policies in Offline Reinforcement Learning

Batıkan Bora Ormancı, Phillip Swazinna, Steffen Udluft, Thomas A. Runkler
11/28/2024
cs.LG

No confident code implementation found for this paper.

Abstract

In this paper, we investigate offline reinforcement learning (RL) with the goal of training a single robust policy that generalizes effectively across environments with unseen dynamics. We propose a novel approach, Trajectory Encoding Augmentation (TEA), which extends the state space by integrating latent representations of environmental dynamics obtained from sequence encoders, such as AutoEncoders. Our findings show that incorporating these encodings with TEA improves the transferability of a single policy to novel environments with new dynamics, surpassing methods that rely solely on unmodified states. These results indicate that TEA captures critical, environment-specific characteristics, enabling RL agents to generalize effectively across dynamic conditions.

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!

Cite this paper

@article{ormanc2024tea,
  title  = {TEA: Trajectory Encoding Augmentation for Robust and Transferable Policies in Offline Reinforcement Learning},
  author = {Batıkan Bora Ormancı and Phillip Swazinna and Steffen Udluft and Thomas A. Runkler},
  year   = {2024},
  eprint = {2411.19133},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.19133v2}
}

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/2411.19133.svg)](https://codeofpaper.com/paper/2411.19133)

Discussion